QUEUE IMPLEMENTATION USING ARRAY
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...
STACK USING LINKED LIST
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...
CREATE STACK USING ARRAY
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 || Data Structure || Chapter one, Two,Three || Notes TU
Unit one ,two, three
If you want to get a Data Structure Complete notes pdf file in your phone or laptop then scroll down and after you can see the comment box so click on...