-

                                    C-PROGRAMQueue- enqueue and dequeue
#include<stdio.h>
void main()
{
int a[10],front=0,rear=0,ch,i;
do
{
printf("QUEUE OPERATIONS\n\t1.Enqueue\n\t2.Dequeue\n\t3.Display\nEnter your choice: ");
scanf("%d",&ch);
switch(ch)
{
case 1:
if(rear==10)
printf("Queue is already full: ");
else
{
printf("Enter an element: ");
scanf("%d",&a[rear++]);
}
break;
    C tutorial video for beginners

case 2:
if(rear==0)
printf("Queue is empty: ");
else
printf("Deleted element is %d",a[front]);
for(i=0;i<rear;i++)
a[i]=a[i+1];
rear--;
break;
case 3:
if(rear==0)
printf("Queue is empty: ");
else
{
printf("Elements are \n");
for(i=0;i<rear;i++)
printf("%d ",a[i]);
}
break;
default:
printf("Invalid entry: ");
}
printf("\nPress (1) to continue: ");
scanf("%d",&ch);
}
while(ch==1);
}

                                                         C Tutorial For beginners



FREE ZONE TUTOR.................................YOUR FEEDBACK IS OUR KEY TO SUCCESS..........FREE ZONE TUTOR.................................YOUR FEEDBACK IS OUR KEY TO SUCCESS...

Comments

Post a Comment

Popular posts from this blog

-
Image
                                    C-PROGRAM   HEAP SORT #include<stdio.h> #include<stdlib.h> void heapify1(int *a, int lim) {int i,j,tmp,left,right,fg=0; i=1; while(fg==0){ left=2*i; right=(2*i)+1; if(right<=lim) { if(a[i]<a[left] || a[i]< a[right]){ if(a[left]>a[right]){ tmp=a[left]; a[left]=a[i]; a[i]=tmp; i=left; } else { tmp=a[right]; a[right]=a[i]; a[i]=tmp; i=right; }} else {fg=1;} }else if (left<=lim){ if(a[left]>a[i]){ tmp=a[left]; a[left]=a[i]; a[i]=tmp; i=left; } else{ fg=1; } }// end o
Read more
-
Image
                                    C-PROGRAM   STACK-push & pop operation #include<stdio.h> void main() { int a[10],it,c,i,fr=0; do { printf("STACK \n 1.PUSH\n2.POP\n3.DISPLAY\nENTER YOUR CHOICE:"); scanf("%d",&c); switch(c) { case 1: if(fr<=9) { printf("enter the element"); scanf("%d",&it); a[fr++]=it; } else printf("stack overflow"); break;      C tutorial video for beginners case 2: if(fr>=0) { printf("the deleted item is %d",a[fr-1]); --fr; } else printf("stack is empty"); break; case 3: for(i=0;i<fr;i++) printf("%d",a[fr]); break; default: printf("invalid operation"); } printf("press 1 to continue"); scanf("%d",&c); }while(c==1); }                            
Read more
-
LINEAR SEARCH IN AN ARRAY                About                                Projects                                Tutorial Videos #include<stdio.h> void main() { int a[10],i,j,n,count=0; printf("enter the array limit:\n"); scanf("%d",&n); printf("enter the array elemants:\n"); for(i=0;i<n;i++) { scanf("%d",&a[i]); } for(i=0;i<n;i++) { for(j=i+1;j<n;j++) { if(a[i]==a[j]) { count=count+1; } } printf("%d repeats %d times\n",a[i],count); }       } FREE ZONE TUTOR.................................YOUR FEEDBACK IS OUR KEY TO SUCCESS..........FREE ZONE TUTOR.................................YOUR FEEDBACK IS OUR KEY TO SUCCESS...
Read more