COSC 2437: Data Structure - Queue Implementations - Data Structure IT Assignment Help

Assignment Task:

Queues:

Problem Statement 
 
1. Add the member function size in both of the provided queue implementations; queueType.h and linkedQueue.h. The function returns the number of elements in the queue. Make sure you test function in both classes (this cannot be done in the same driver program). 
 
2. Write the program queuesFun.CPP that uses the modified LinkedQueue class in part 1. The program includes the following functions: 
a. Template function element(LinkedQueue<T> &q, int n) that returns  and removes the nth element in queue q.  
b. Template function isEqualQueues that receives two queues; q1 and q2.  The function returns true if the queues are the same and false otherwise. The function should leave the queues unchanged.  
c. Template function divide(q, q1, q2) that copies the 1st half of q into q1 and the 2nd half into q2, leaving the original queue unchanged. You may assume that q always has an even number of elements
d. Template recursive function append(q1, q2)that appends q2 at the end of  q1. q2 should be empty after calling the function.

This COSC 2437: IT Assignment has been solved by our Data Structure Experts at My Uni Paper. Our Assignment Writing Experts are efficient to provide a fresh solution to this question. We are serving more than 10000+ Students in Australia, UK & US by helping them to score HD in their academics. Our experts are well trained to follow all marking rubrics & referencing style.

Be it a used or new solution, the quality of the work submitted by our assignment experts remains unhampered. You may continue to expect the same or even better quality with the used and new assignment solution files respectively. There’s one thing to be noticed that you could choose one between the two and acquire an HD either way. You could choose a new assignment solution file to get yourself an exclusive, plagiarism (with free Turnitin file), expert quality assignment or order an old solution file that was considered worthy of the highest distinction.