PROGRAM TO MERGE TWO ARRAYS

/* PROGRAM TO MERGE TWO ARRAYS */ #include<stdio.h> #include<conio.h> void main() { int a[100],b[50],i,j,num_a,num_b; textcolor(91); clrscr(); printf(“\n\n\t\tENTER THE NUMBER OF ELEMENTS FOR ARRAY A :”); scanf(“%d”,&num_a); printf(“\n\n\t\tENTER ELEMENTS of A\n”); for(i=1;i<=num_a;i++) { printf(“\n\n\t\t”); scanf(“%d”,&a[i]); } printf(“\n\n\t\tENTER THE NUMBER OF ELEMENTS FOR ARRAY B :”); scanf(“%d”,&num_b); printf(“\n\n\t\tENTER ELEMENTS OF B\n”); for(i=1;i<=num_b;i++) { printf(“\n\n\t\t”); scanf(“%d”,&b[i]); a[num_a+i]=b[i]; } […]

Continue Reading

Program to Find Maximum Element from an array

/* Program to Find Maximum Element from an array */ #include<stdio.h> #include<conio.h> void main() { int aray[20],max,i,num; clrscr(); printf(“\n\n\t\tENTER THE NUMBER OF ELEMENTS : “); scanf(“%d”,&num); printf(“\n\n\t\tENTER ELEMENTS\n”); for(i=1;i<=num;i++) { scanf(“%d”,&aray[i]); } max=aray[1]; for(i=1;i<=num;i++) { if(aray[i]>=max) { max=aray[i]; } } printf(“\n\n\t\tTHE MAXIMUM ELEMENT OF ARAY IS :%d”,max); getch(); }

Continue Reading

PROGRAM TO FIND ODD AND EVEN NUMBERS

/* PROGRAM TO FIND ODD AND EVEN NUMBERS */ #include<stdio.h> #include<conio.h> void main() { int aray[30],odd[30],even[30],i,num; int even_count=0,odd_count=0; clrscr(); printf(“\n\n\t\tENTER THE NUMBER OF ELEMENTS :”); scanf(“%d”,&num); printf(“\n\n\t\tENTER ELEMENTS\n”); for(i=1;i<=num;i++) { printf(“\n\n\t\t”); scanf(“%d”,&aray[i]); } for(i=1;i<=num;i++) { if(aray[i]%2==0) { even_count++; printf(“\n\n\t\teven number %d\t\n”,aray[i]); } else { odd_count++; printf(“\n\n\t\todd number %d\t\n”,aray[i]); } } printf(“\n\n\t\tYOU HAVE ENTERED EVEN NUMBERS […]

Continue Reading

PROGRAM TO FIND THE SUM OF DIAGONAL ELEMENTS

/* PROGRAM TO FIND THE SUM OF DIAGONAL ELEMENTS */ #include<stdio.h> #include<conio.h> void main() { int aray[10][10],i,j,row,col,sum=0; clrscr(); printf(“\n\nENTER THE NUMBER OF ROWS : “); scanf(“%d”,&row); printf(“\n\nENTER THE NUMBER OF COLUMNS :”); scanf(“%d”,&col); printf(“\n\nENTER THE ELEMENTS OF MATRIX \n\n”); for(i=1;i<=row;i++) { for(j=1;j<=col;j++) { scanf(“%d”,&aray[i][j]); } } for(i=1;i<=row;i++) { for(j=1;j<=col;j++) { if(i==j) sum=sum+aray[i][j]; } } printf(“\n\n\t\tTHE […]

Continue Reading

PROGRAM TO FIND THE SUM AND AVERAGE OF N ELEMENTS

/* PROGRAM TO FIND THE SUM AND AVERAGE OF N ELEMENTS */ include<stdio.h> include<conio.h> void main() { int aray[30],i,num,count=0; float avg=0.0,sum=0.0; clrscr(); printf(“\n\n\t\tENTER THE NUMBER OF ELEMENTS :”); scanf(“%d”,&num); printf(“\n\n\t\tENTER ELEMENTS\n”); for(i=1;i<=num;i++) { printf(“\n\n\t\t”); scanf(“%d”,&aray[i]); count++; } for(i=1;i<=num;i++) { sum=sum+aray[i]; } printf(“\n\n\t\tTHE SUM OF ENTERED NUMBERS IS : %f”,sum); avg=sum/count; printf(“\n\n\t\tTHE AVERAGE OF ENTERED NUMBERS […]

Continue Reading

PROGRAM TO PRINT THE ARRAY ELEMENTS

/* PROGRAM TO PRINT THE ARRAY ELEMENTS */ #include<stdio.h> #include<conio.h> void main() { int aray[30],i,num; clrscr(); printf(“\n\n\t\tENTER THE NUMBER OF ELEMENTS :”); scanf(“%d”,&num); printf(“\n\n\t\tENTER ELEMENTS \n\t\t”); for(i=1;i<=num;i++) { scanf(“%d”,&aray[i]); printf(“\n\t\t”); } printf(“\n\n\t\tYOU HAVE ENTERED THE FOLLOWING ELEMENTS \n”); for(i=1;i<=num;i++) { printf(“\n\n\t\t%d”,aray[i]); } getch(); }

Continue Reading

Solved Problem using C Language (SUPPOSE IN A SHIP THERE ARE 30 PERSONS AND 15 LIFE JACKETS.ONLY THESE LIFE JACKETS CAN SAVE THE LIFE OF PERSONS.WE HAVE TO SET THE LOOP IN SUCH A WAY THAT ONLY CAPTAIN’S 15’S EMPLOYEES GET LIFE JACKETS AND SAVE THEIR LIFE)

/* SUPPOSE IN A SHIP THERE ARE 30 PERSONS AND 15 LIFE JACKETS.ONLY THESE LIFE JACKETS CAN SAVE THE LIFE OF PERSONS.WE HAVE TO SET THE LOOP IN SUCH A WAY THAT ONLY CAPTAIN’S 15’S EMPLOYEES GET LIFE JACKETS AND SAVE THEIR LIFE. */ / * INCLUDE HEADER FILES***/ #include<stdio.h> #include<conio.h> / * DECLARE SELF-REFRENTIAL […]

Continue Reading

WRITE A PROGRAM TO PERFORM THE OPERATIONS OF SINGLY LINKED LIST

/*WRITE A PROGRAM TO PERFORM THE OPERATIONS OF SINGLY LINKED LIST */ / * INCLUDE HEADER FILES**/ #include<stdio.h> #include <conio.h> #include <string.h> #include <ctype.h> / * DECLARE SELF REFRENTIAL STRUCTURE/ struct node { char info[40]; struct node next;//POINTER WHICH POINTS TO THE NEXT NODE }head=NULL; / * DECLARATION OF THE FUNCTIONS THAT ARE USED IN […]

Continue Reading

WRITE A PROGRAM TO IMPLEMENT VARIOUS OPERATION ON DOUBLE CIRCULAR LINKED LIST USING STRING

/*INCLUDE HEADER FILES**/ #include<stdio.h> #include<conio.h> #include<ctype.h> /*DECLARE PROTOTYPE OF FUNCTIONS**/ void insert(); void delet(); void display(); void modify(); void upper(); void sort(); void location(); void remove1(); /*DECLARE SELF REFRENTIAL STRUCTURE**/ struct linked_list { char info[50]; struct linked_list *next; struct linked_list *prev; }start=NULL,node,tail,loc1,*ptr; /*MAIN FUNCTION START HERE**/ void main() { int choice,check; //DECLARE LOCAL VARIABLE char […]

Continue Reading

TO ENTER THE STRINGS IN STACK USING POINTERS

/ * TO ENTER THE STRINGS IN STACK USING POINTERS */ /*HEADER FILES****/ #include<stdio.h> /*TO USE scanf() & printf()*/ include<conio.h>/*TO USE getch()*/ include<stdlib.h>/*TO USE exit()*/ /*USING OF STRUCTURE*/ typedef struct node / * CHANGES NAME OF EXISTING DATA TYPES * / { char info[50]; struct node *next; /*USE OF SELF REFRENTIAL STRUCTURE* TO POINT TO […]

Continue Reading

Program to implement Doubly Linked List with String using C Language

/* Program to implement Doubly Linked List with String using C Language */ #include<studio.h> #include<conio.h> #include<string.h> #include<ctype.h> struct list { char info[40]; struct list *next; struct list *prev; }head=NULL,tail=NULL; void insertion(); void deletion(); void display(); void modify(); void main() { int choice,check; char ch; clrscr(); do { textcolor(9); clrscr(); printf(“\n\n\t===============================================”); printf(“\n\n\t\t\tMENU”); printf(“\n\n\t===============================================”); printf(“\n\n\t1.INSERT THE STRING […]

Continue Reading

Implement Quicksort in C Language

#include <stdio.h> #define MAXARRAY 10 void quicksort(int arr[], int low, int high); int main(void) { int array[MAXARRAY] = {0}; int i = 0,n; printf(“Enter number of elements”); scanf(“%d”,&n); for(i = 0; i < n; i++) scanf(“%d”,&array[i]); printf(“Before quicksort: “); for(i = 0; i < n; i++) { printf(” %d “, array[i]); } printf(“\n”); quicksort(array, 0, […]

Continue Reading