Homework Assignment 7

Due THURSDAY 4 December at 5pm Eastern time to the CSE dropbox.

The text of the assignment is here.

A sample version of a main class is here. You need not use this, and you probably don't want to use this verbatim, but it can be used as a hint for how to write your code.

The interface for the MyGraph.java class is here.

Here is sample input and sample output. This is the graph of the handout from Carrano's book. Note that he uses labels ABCDEFGHI on his graph, and I have used numerical subscripts running zero-up, so A=0, B=1, etc.

Here is sample input and sample output for another small graph.

Here is sample input and sample output for a large graph.

Here is sample input and sample output for another large graph.

My suggestion is that you get the Carrano graph and the zin1 done, and then try to do the larger graphs. For these two larger graphs, the big deal will be to get the traversal list at the end of either the BFS or the DFS.

Homework Assignment 6

Due THURSDAY 20 November at 5pm Eastern time to the CSE dropbox.

The text of the assignment is here.

A sample version of a main class is here. You need not use this, and you probably don't want to use this verbatim, but it can be used as a hint for how to write your code.

The interface for the packet assembler is here.

Here is sample input and sample output

Homework Assignment 5

Due Tuesday 11 November 2008 (NEW DATE) at 5pm Eastern time to the CSE dropbox.

The text of the assignment is here.

Note that a fair bit of this assignment is code just to be able to verify that you have implemented the data structure correctly.

A sample version of a main class is here. You need not use this, and you probably don't want to use this verbatim, but it can be used as a hint for how to write your code.

The interface for the BST is here.

The interface for the BTNode is here.

The interface for the individual record is here.

Here is the input and output for the full paper as input text.

Here is the input and output for just the abstract of the full paper as input text.

Here is the input and output for a sorted version of the abstract of the full paper as input text. Note that with the sorted version you get a pessimal BST.

Here is the file to be used as the search test

The sample output given here has a lot of debugging stuff still left in. This is so you can compare your output against mine just to see if we are getting the same answers. I do not expect that your output has to exactly match mine.

Homework Assignment 4

Due Tuesday 28 October 2008 at 5pm Eastern time to the CSE dropbox. NOTE THE DATE CHANGE.

The text of the assignment is here.

Homework Assignment 3

Due Tuesday 7 October 2008 at 5pm Eastern time to the CSE dropbox.

The text of the assignment is here.

Sample output for numbers 100 through 200.

Sample output for numbers 1001000 through 1002000.

Sample methods for heap fixing up and down have been emailed to your engr account.

Homework Assignment 2

Due Tuesday 23 September 2008 at 5pm Eastern time to the CSE dropbox.

The text of the assignment is here.

The IStack interface is here.

Sample input is here and sample output is here

Your output need not match up exactly with the sample output. The sample has extra debugging and tracing information that you might not have to include in a final version of the program.

Homework Assignment 1

Due Tuesday 9 September 2008 5pm Eastern time to the CSE dropbox.

The text of the assignment is here.

Code fragments and required interfaces are

• IDLL.java
• IDLLNode.java
• IKey.java
• IRecordKeyed.java
• Sample input
• Sample output (Note that this output is vast overkill for a "finished" piece of work, but if your code produces this kind of logging information as you execute you are likely to be able more quickly to find any bugs in the code.)