Tech-knos

Posts

- November 07, 2017

C-PROGRAM LINKED LIST #include<stdlib.h> #include<stdio.h> struct node { int a; struct node *next; }; void display(struct node *temp) { printf("\n elements in the list are\n"); while(temp!=NULL) { printf("\t %d",temp->a); temp=temp->next; } } struct node *insert(struct node *start) { struct node *temp,*prev; int pos; temp=(struct node*)malloc(sizeof(struct node)); printf("enter the number of elements"); scanf("%d",&temp->a); printf("select the position to insert the number\n1.at the begning\n2.at the end\n3.at specified position"); scanf("%d",&pos); switch(pos) { case 1:temp->next=start; start=temp; break; case 2:prev=start; while(prev->next!=NULL) { prev=prev->next;} prev->next=temp; temp->next=NULL; break; case 3: printf("...

- November 07, 2017

C-PROGRAM Queue- 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: ...

- November 07, 2017

C-PROGRAM PROGRAM TO CHECK WHETHER ENTERED YEAR IS LEAP YEAR #include<stdio.h> void main() { int a; printf("enter the year to be checked"); scanf("%d",&a); if(a%4==0) { if(a%100==0) { if(a%400==0) printf("Leap year"); C tutorial video for beginners else printf("Not a leap year "); } else printf("Leap year"); } else printf("Not a leap year"); } C Tutorial For beginners FREE ZONE TUTOR.................................YOUR FEEDBACK IS OUR KEY TO SUCCESS..........FREE ZONE TUTOR.................................YOUR FEEDBACK IS OUR KEY TO SUCCESS... ...

- November 07, 2017

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); } ...

- October 29, 2017

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...

- October 23, 2017

STRING MANIPULATION STRING MANIPULATION About Projects Tutorial Videos #include<stdio.h> int leng(char s1[10]) { int count=0,i=0; while(s1[i]!='\0') { count++; i++; } return(count); } void con(char s1[10],char s2[10]) { char s[20]; int l1,l2,i,j=0; l1=leng(s1); l2=leng(s2); for(i=0;i<l1;i++) { s[i]=s1[i]; } for(i=l1;i<l2+l1;i++) { s[i]=s2[j]; j++; } printf("--------------------------------------------\n THE CONCATINATED RESULT OF THE ENTERED STRING IS : \n %s\n------------...