233 Computer Science 3, Spring 20053

What's New

• May 2nd: Added study guide for exam 2
  Added location for exam 2, for sec 7 (2-3pm class)
  Added time/date/location for the final
• April 4th: Added searching and recursion examples
  Added study guide for test 1
• March 27th: Added serializable example
• March 23rd: Added steps to create and print a data file containing a set of points using gnuplot
• March 22nd: Added example code from week 1
• March 8th: Created page

Lecture Material

The class slides come with some slight modifications from Prof. Bayliss cs2 and cs3 notes.

More class slides from Prof. Adams' cs2 and cs3 notes.

Week	Extra Material	Notes
1	Linked List Code	This Linked List implementation uses generics.
2	example data point file file containing gnuplot commands	To plot your data for Knapsack: Save the two files to the left Edit the p3 file to add your own data Run gnuplot At the gnuplot> prompt type load 'p3_plot_print' You need to include the filename in quotes This will create a file called p3.ps Type quit in gnuplot Run the command gv p3.ps Use file-print to print the ploT
3	Serializable Sample Code Search Sample Code	Iterative versions of linearSearch and binarySearch both using generics.
4	Recursive Functions	Recursive versions of linearSearch and binarySearch both using generics. NEW
5	Sort algorithms	Code for the five sort routines discussed in class.
6	Jar file to copy Instructions to run the ATM	A non-graphic ATM which can be used to test you bank.

Course Information

• Syllabus
• Schedule
• Labs
• Projects

Exams

Note Number	Note

Links

• Course Web page at: 4003-233