Open data structures in C++ array based list please

Exercise 2.2.

Design and implement a RandomQueue. This is an imple- mentation of the Queue interface in which the remove() operation removes an element that is chosen uniformly at random among all the elements currently in the queue. (Think of a RandomQueue as a bag in which we can add elements or reach in and blindly remove some random element.) The add(x) and remove() operations in a RandomQueue should run in con- stant time per operation.

Exercise 2.6.

Modify the ArrayDeque implementation so that the shift- ing done by add(i,x), remove(i), and resize() is done using the faster System.arraycopy(s,i,d,j,n) method.