CSci 2101 Data Structures: Lab 6

Problem 1

public class TestCounters {
    public static void main(String [] args) {
	LinkedList list = new LinkedList();

	for (int i = 1; i < 50; i = 2 * i) {
	    Node n = new Node(i);
	    list.addFront(n);
	}
	
	Node current = list.getFirst();
	while (current != null) {
	    System.out.println(current.getData());
	    current = current.getNext();
	}
	
    }
}

Part 2 (graded). In the class Node add a static counter for the constructor and a static counter for each of the other three methods. The counter for a method will be incremented every time the method gets called. Add a static method printCounters() to print out all of the counters. Add a call to printCounters() at the end of the program TestCounters.java to find out how many time each method was called. Write the results in comments and explain all the numbers.

This approach can be used to compare efficiency of two different implementations of the same data structure.