Notes

  BCA Third Semester ADDITON OF TWO POLYNOMIAL datastructure #include<stdio.h> #include<malloc.h> #include<conio.h> struct link{ int coeff; int pow; struct link *next; }; struct link *poly1=NULL,*poly2=NULL,*poly=NULL; void create(struct link *node) { char ch; do { // clrscr(); printf("n Enter coeff : "); scanf("%d",&node->coeff); printf(" Enter power : "); scanf("%d",&node->pow); node->next=(struct link*)malloc(sizeof(struct link)); node=node->next; node->next=NULL; printf("n Continue(y/n):"); ch=getch(); } while(ch=='y' || ch=='Y'); } void show(struct link *node) { while(node->next!=NULL) { printf("%dx^%d",node->coeff,node->pow); node=node->next; if(node->next!=NULL) printf("...

bca third semester doubly linked list data structure program   #include<stdio.h> #include<conio.h> #include<malloc.h> int pos,i,n,item; struct doubly { int data; struct doubly *pre, *next; }; struct doubly *head, *tail, *temp, *temp1, *temp2, *nw; void insert_b() { int item; clrscr(); printf("Enter Item : "); scanf("%d",&item); nw = (struct doubly *)malloc(sizeof(struct doubly)); nw -> data =...

  BCA Third Semester Singly Linear link list data structure #include<stdio.h> #include<conio.h> #include<malloc.h> struct link { int data; struct link *next; };struct link *nw, *head, *tail, *temp1, *temp2; void insert_begin(); void insert_middle(); void insert_end(); void delete_begin(); void delete_middle(); void delete_end(); void display(); void main() { int item,ch; do { clrscr(); printf("1. Insert Node of Beginning : n2. Insert Node...

queue using linked list BCA THird semester Data Structure'     #include <stdlib.h> struct node { int data; struct node *link; }; struct node *temp,*front, *rear; /* Global Declarations */ void Insert(int); int Delete(); void Display(); main() { /* Main Program */ int opn, elem; front = rear = NULL; do { clrscr(); printf("n1....

QUEUE IMPLEMENTATION (ALL OPERATION) DaTA STRUCTURE #include<conio.h> #include<stdio.h> #define N 5 int queue={0}; int rear=0,front=0; void insert(void); void del(void); void disp(void); void cre(void); void main() { int user=0; clrscr(); do { clrscr(); printf("nTHE SIZE OF QUEUE IS = %d",N); printf("nn 1. INSERT A New Element"); printf("n 2. DELETE A First Element"); printf("n 3. DISPLAY A...

Data structure is a particular way of storing and organizing information  in a computer  so that it can be retrieved and used most productively. Data structures are important for the following reasons:    1. Data structures are used in almost every...

  QUEUE IMPLEMENTATION USING ARRAY BCA third semester DATA STRUCTURE   #include<stdio.h> #include<conio.h> #include<stdlib.h> #define max 5 int front=0,rear=-1; int queue; void main() { int ch,i; while(1) { clrscr(); printf("1. Insertionn2. Deletionn3. Displayn4. ExitnnEnter your Choice : "); scanf("%d",&ch); switch(ch) { case 1: clrscr(); if(rear == max-1) printf("Queue Overflow !!!!"); else { rear++; printf("Enter Element : "); scanf("%d",&queue); } getch(); break; case 2: clrscr(); if(front>rear) printf("Queue Underflow !!!!"); else { printf("%d is deletion...

        bca third semester stack using linked list program data structure       #include<stdio.h> #include<conio.h> #include<malloc.h> struct stack { int data; struct stack *next; };struct stack *nw, *temp, *top; void push() { int item; clrscr(); printf("Enter Element : "); scanf("%d",&item); if(top->data...

bca third semester Create stack using Array program data structure This Implementation is correct you can use our program if you like please share with your BCA Friend.   #include<stdio.h> #include<conio.h> #define max 5 void push(); int pop(); void display(); int stack; int top=-1; void main() { int n,item,ch,ele; clrscr(); do { clrscr(); printf("1. Push...

BCA Third semester some Notes . Its Note is Only available for Study Purpose not for Third Party. if you need More Notes of BCA Semester wise complete Please comment us or message in...