- NEW!
by Stableboy on January 26th, 2008
On Answerbag, your inquiry needs to be in the form of a question.
If you're asking us to write implementations of all these queues for you, you can probably forget it -- but we can provide helpful tips if you struggle with the problem yourself first and ask specific questions.
by vikgupta07 on December 18th, 2009
queue is a linear ds where the data transfer takes place both at rear end and front ends.
types:
1.simple queue:
insertion from rear end
deletion from front end
//insertion in simple queue
void insert(int queue[],int ele)
{
if(rear==size-1)
{
printf("queue is fill");
}
else
if(rear==-1)
{
rear=front=0;
queue[rear]=ele;
}
else
rear=rear+1;
queue[rear]=ele;
}
int delete(int queue[])
{
if(front==-1)
{
printf("the queue is empty");
return(0);
}
elseif(front==rear)
{
front=rear=-1;
ele=queue[front]'
}
else
{
ele=queue[front];
front=front+1;
return(ele);
}
similarly use % for circular queues
vikram gupta
itm
by Gaurav on August 1st, 2009
what is acutal use of queue in c++ programming Also where can we use this ?
need little programing help?
by daredevil on March 22nd, 2010
| 1 person likes this
first top ten engineering college in the world
by lathasindhu91 on January 27th, 2010
| 1 person likes this
I need a simple syntex code for duplicate elimination in C
by mrwigglesjean on September 2nd, 2010
| 1 person likes this
#include
int main(){
float f=1.63;
if(f==1.63)
printf("true\n");
else
printf("flase");
getch();}
by sam2483 on May 15th, 2010
| 1 person likes this
what is the best and most simple to use C programming.. program? I switched to microsoft visual 08 but I dont understand how to use it
by Anonymous on February 24th, 2010
| 1 person likes this
Your favorite Q&A site is on Facebook! Become a fan to connect with the ever-growing community of Answerbaggers, share your thoughts and find out what Answerbag's up to next!
Comments