Computer sample paper deque program

Active member

I need someone to kindly check the program on deque Q 12 in the sample paper...it's completely my own logic and I want someone to please verify it......thanxxxxx

class chain
{ int ele[];
int cap,front,rear;
chain(int max)
{ cap=max;
front=0;rear=0;
ele=new int[cap];
}
void pushfront(int v)
{ if((front>0)||(front==0&&rear==0))
{ ele[--front]=v;
}
else
{ System.out.println("Full from front");
}
}
int pop()
{ if(front==0&&rear==0)
{ return 999;
}
else
{ ++front;
return(ele[front-1]);
}
}
void pushrear(int v)
{ if(rear==cap-1)
{ System.out.println("Full from rear");
}
else
{ ele[++rear]=v;
}
}
int poprear()
{ if(front==0&&rear==0)
{ return 999;}
else
{ --rear;
return(ele[rear+1]);
}
}
}

Active member

i thnk its totally right....i posted the same for stacks..... Basketball

Subject: Re: Computer sample paper deque program Sun May 23, 2010 8:00 pm

please send dome sample paper for icse computer syllabus with ans