Java Foundations

Hand trace an ordered list X through the following operations: By "hand-trace", we mean for each of the 9 lines of code, you should write a line of text that states the content of the list X as well as the value of its count, after that line of code runs.

X.add(new Integer(4)); X.add(new Integer(7));

Object Y = X.first(); X.add(new Integer(3));

X.add(new Integer(2));

X.add(new Integer(5));

Object Y = X.removeLast();

Object Y = X.remove(new Integer(7));

X.add(new Integer(9));

What would be the time complexity of the size operation for the linked implementation if there were not a count variable?

In the linked implementation, under what circumstances could the head and tail references be equal?

Hand trace an unordered list through the following operations. By "hand-trace", we mean for each of the 9 lines of code, you should write a line of text that states the content of the list X as well as the value of its count, after that line of code runs.

X.addToFront(new Integer(4)); X.addToRear(new Integer(7));

Object Y = X.first();

X.addAfter(new Integer(3), new Integer(4));

X.addToFront(new Integer(2));

X.addToRear(new Integer(5));

Object Y = X.removeLast();

Object Y = X.remove(new Integer(7));

X.addAfter(new Integer(9), new Integer(3));