Welcome! Log In Create A New Profile

Advanced

Assignment 2 question 4: Queues

Posted by Anonymous User 
Announcements Last Post
Announcement myUnisa availability 21 to 24 March 2019 03/17/2019 02:24PM
Announcement SoC Curricula 09/30/2017 01:08PM
Announcement Demarcation or scoping of examinations and assessment 02/13/2017 07:59AM
Announcement School of Computing Short Learning Programmes 11/24/2014 08:37AM
Announcement Unisa contact information 07/28/2011 01:28PM
Anonymous User
Assignment 2 question 4: Queues
March 23, 2011 02:53PM
For question 4 (a), to find item n in a queue, how do you traverse to get through the queue? I cannot seem to find an example in the textbook (unless I'm missing it).

Or do you pop the front element if it is not n, and move through the queue by popping the front each time until you find n (or until front is NULL)?

The same would apply for (b), because you would need to traverse the queue to find the last instance of x.

Could someone please shed some light?
Re: Assignment 2 question 4: Queues
March 25, 2011 04:29PM
I am also a little stuck with this question. I think it is a bit silly as the whole point of a queue is an ordered list type, so it should not be required to access items out of sequence.

I used a loop to pop as many items as required from the list, and then used front() function to return the required item.
Although this works it is not elegant as the queue is destroyed, so I don't think it's right. It is possible to build a new queue as described below.

For the second part:
One way to do it will be to pop items from the queue, do the operation (compare and store position of last occurence in queue) and then immediately push items into other queue.
Then you can pop items from the new queue and push back into into the old queue, but replace with new value when the correct position is reached.

Hope this helps

Francois
Anonymous User
Re: Assignment 2 question 4: Queues
March 28, 2011 02:58PM
Thanks Francois, I'll give it a go.
Sorry, only registered users may post in this forum.

Click here to login