Which of the following queue creates overflow when the no of elements is
less than the queue size??
1)single queue
2)priority queue
3)dequeue
4)circular queue
Kindly explain what is the answer and why??? Thanks in advance..
--
You received this message because you are subscribed to the Google
Circular queue
Expalanation- think of the condition for overflow
On 24-Jul-2012, at 9:52 PM, Hariraman R rpharira...@gmail.com wrote:
Which of the following queue creates overflow when the no of elements is less
than the queue size??
1)single queue
2)priority queue
3)dequeue
4)circular
@mind blogger,
Thank u:) Got it...:)
--
You received this message because you are subscribed to the Google Groups
Algorithm Geeks group.
To post to this group, send email to algogeeks@googlegroups.com.
To unsubscribe from this group, send email to
algogeeks+unsubscr...@googlegroups.com.
Hi,
The implementation is simple using 2 stacks, however we also need to make
sure that if queue length is say x, we are able to enqueue x elements. As
per my understanding, i could think of the solution using 4 stacks instead
of 2(1 for enqueue, 1 for dequeue, 1 aux for enqueue, 1 aux for
Hi,
I know that a stack can be modified with another stack to support push
pop min in const time.
Design a FIFO data structure to support ins, del, and find min in
O(1). Extra space allowed.
--
You received this message because you are subscribed to the Google Groups
Algorithm Geeks group.
To
Can we use circular linked list with each new inserted node keeping track of
the minimum before it??
On Fri, Jun 24, 2011 at 3:20 PM, ross jagadish1...@gmail.com wrote:
Hi,
I know that a stack can be modified with another stack to support push
pop min in const time.
Design a FIFO data
Give a good data structure for having n queues ( n not fixed) in a
finite memory segment. You can have some data-structure separate for
each queue. Try to use at least 90% of the memory space.
--
You received this message because you are subscribed to the Google Groups
Algorithm Geeks group.
To
there is a linked list where each node of linked list points to queue.. for
eg. 1st node points to queue 1 2nd to queue 2 nd so on..
hope m clear this time..
On 20 June 2010 18:30, Piyush Verma 114piy...@gmail.com wrote:
@divya
plzz explain little more. m not getting...
--
You received this
@divya
if ith queue is full and i want to enque some value in ith queue then what
should be the condition
--
You received this message because you are subscribed to the Google Groups
Algorithm Geeks group.
To post to this group, send email to algoge...@googlegroups.com.
To unsubscribe from
