General Information

Instructor: Geoffrey Towell, 246C Park Hall, 526-6503
E-Mail: gtowell at cs dot brynmawr dot edu
Office Hours

	Tuesday	1pm-2pm
	Wednesday	9am-11am
	Thursday	1pm-2pm

WWW: http://cs.brynmawr.edu/~gtowell

Lecture Hours: Tuesdays & Thursdays, 10:00 am to 11:30 am
Room: Park 338

Lab Hours:

	Friday	11am--noon
	Friday	9am--10am

Lab room: PC Lab Room 231 (Science Building)

---

Texts & Software

• Data Structures & Algorithms in Java, 2nd Edition by Robert Lafore, Sams 2002.
  
  In addition, you will need a good Java reference. Here are some recommendations:
  
  
• Java in a Nutshell, David Flanagan, O'Reilly Publishers.
• Java Precisely, Peter Sestoft, MIT Press 2002
• Or, your old CS110 text will do.
  
  
• Software: We will be using the Java programming language for all laboratory exercises. The labs will use the Java SDK installed on the Computer Science Linux cluster in Room 231. The Linux server can be accessed via a terminal session from any networked computer on campus via a SSH client. the campus.

• Workshop applets: your textbook comes with some very useful applets which are graphics-based demonstrations of how certain data structures work. You can access these applets here.
  

---

Important Dates

January 18: First lecture
March 24: Midterm
April 28: Last lecture
Final: TBA

Grading

All graded work will receive a score out of 100. Guidelines of letter grades corresponding to lab/exam score levels will be given during the semester. At the end of the semester, a total score (to which the corresponding final grade is assigned) will be calculated from a weighted average of all scores according to the following weights:

Midterm: 15%
Final: 25%
Projects: 60%
Total: 100%

Assignments

Rules for handing in assignments:

• I will not discuss assignments on the day before they are due.
• Assignments can be handed in for full credit on or before the due date.
• Testing and analysis are important.
• After the due date, assignments will be penalized 10% per day late (unless specific arrangements are made).
• On any assignment, if you hand in something that is not working correctly, an accurate description of the problem and suggestions about possible causes will be worth 50% (or more) of a correctly working program. For example, if the assignment does not work correctly and would have received a grade of 70, a good analysis of the problem and possible solutions could receive 15 points, thereby raising the grade to 85.
• Do not use the print button in emacs when you hand in printouts of java code . Please print the code using a unix command like:
       enscript -2 -G -r -Ejava MyClass.java
  This both saves a little paper and creates printouts that are much easier to read.
• At the top of every class file you submit should be the following:
  

  /** * Name: Your Name * Exercise: Exercise# * Date: Date completed * Purpose: A short description of what this class does in the context of the entrie * program. **/

• In addition to a paper copy of your code, you will submit an electronic copy. Follow these directions:
  1. Goto the directory containing all of the class files for the assignment
  2. Create a directory named META-INF. To do this entery the command
     mkdir META-INF
  3. Into the META-INF directory put a file named MANIFEST.MF containing the following line:
     

     Main-Class: XXXX

     where XXXX is the name of the class file of the main class for the assignment. An easy way to do this is:

     cd META-INF
     cat > MANIFEST.MF
     Main-Class: XXXX
     <ctrl> d
     cd ..
     

     where <ctrl> d means hold down the "control" key and hit d.
  4. Enter the command
     jar fc YYYY.jar *.class *.java META-INF/MANIFEST.MF
     where YYYY.jar is your name and assignment number (e.g., towell4.jar)
  5. Check the jar file to make sure it was created correctly. If it is correct you should be able to execute your program by the following command:
     java -jar YYYY.jar
  6. Submit your program by copying to the incoming directory using the following command:
     cp YYYY.jar /home/gtowell/cs206/incoming/

Planned Syllabus

---

Lectures

• Week 1
  January 18: Intro to the course
  January 20: lecture notes
  

  ---

• Week 2
  January 25: Lecture notes
  January 27: Lecture notes on inheritance, access, overloading, overriding and constructors
  

  ---

• Week 3
  February 1: Lecture notes of Constructors, casting, algorithms and making classes
  February 3: Lecture notes of class building including extends vs implements

  ---

• Week 4
  February 8: Lecture notes on linear and binary search AND introduction to complexity analysis
  February 10: Lecture notes on bubble, insertion and selctions sorts
  

  ---

• Week 5
  February 15: Stacks and Queues
  February 17: Priority Queues, Paren matching with Stacks, Modeling the Registrar
  

  ---

• Week 6
  February 22: Registrar and intro to linked lists
  February 24: Linked lists
  

  ---

• Week 7
  March 1: Linked lists
  March 3: Circular linked lists and the Josephus problem
  

  ---

• Week 8
  March 8: Spring Break
  March 10: Spring Break
  

  ---

• Week 9
  March 15: Recursion -- will not be on the midterm
  March 17: Midterm Review
  

  ---

• Week 10
  March 22: MIDTERM -- in class. Open book. Open notes. Closed computer
  March 24: March 15: Recursion -- part 2
  

  ---

• Week 11
  March 29: Trees
  March 31: Trees
  

  ---

• Week 12
  April 5: Hash Tables
  April 7: More Hash Tables
  

  ---

• Week 13
  April 12: Quick sort
  April 14: heaps and heap sort
  

  ---

• Week 14
  April 19: Graphs
  April 21: Graphs and Dijkstra's algorithm
  

  ---

• Week 15
  April 26: Playing Games -- no lecture notes
  April 28: Final Review -- last semester's final
  

Links

• Java Applets from CS110 in fall 2004: Some example applets that will be helpful in reviewing some Java essentials.
• Java API
• Workshop applets from Text
• the most useful Unix commands