Comp 212: Intermediate Programming

• PLEASE SEND AN E-MAIL WITH YOUR AND YOUR PROJECT 4 PARTNER'S NAMES TO DR. NGUYEN AND DR. WONG ASAP !! Our records are currently incomplete and we cannot grade your work until we know who the teams were.
  
  
• THE FINAL EXAM IS HERE!!
  • You will have 5 hours to complete the exam once you have started it.
  • You have unlimited preparation time however, so
    • Review the notes on Sorting. Download the code and study it!
    • Gather together the code from the Recursive Descent Parsing laboratory and make sure you understand it.
  • Do not read the exam until you are fully prepared to take the exam! Click here to read the exam.
    
    
• Othello Final Round Results: The results from the final round of the Othello tournament can be found here. Congratulations to all for their time, effort and talents!
  
• Othello First Round Results: The results from the first round of the Othello tournament can be found here. Thanks to all who participated!
• Othello Tournament Signup: Open the world writable file /home/comp212/OthelloSignup and add the path to your group's othello player. For instance, suppose the default package directory was /home/comp212/instructorCode and the strategy was in the comp212prof package. The path to supply should be "/home/comp212/instructorCode/comp212prof". Your strategy package should be just below the default package (do not put it below the model package!). If the class to use is not obvious, please include a readme file in the directory. Keep in mind though, multiple people can have the file open at once. So, check the file about 5 mins after you save it to make sure no one overwrote your entry. Also try to add your entry as quickly as possible so you minimize the chances you overwrite someone else. Everyone should enter!

• Othello Tournament Rules are here.

  For the tournament, your strategy must have either a constructor with no parameter or a constructor with a single IModel parameter. This is not required for the project milestones -- do not duplicate code in your project work!

• Here is a sample strategy that is not too smart, but not entirely stupid either (read: your professors wrote it!).
  • comp212prof.zip
  • Test your code against it! Directions:
    • unzip the code into your default package directory. A package called comp212prof should be created.
    • run the tournament code, and in the "add player" text field, type "comp212prof.SBW_DXN_strategy<Enter>". The field should clear.
    • The new strategy should now appear on the drop lists.
• Project 4 is updated with new interfaces, source code, and HINTS!!
  • The conditionals used in the updateBest for MinAcc and MaxAcc must match the conditionals you use in AlphaAcc and BetaAcc! That is, use "<" and">" everywhere, or use ">=" and "<=" everywhere. You will get very funny behavior otherwise, e.g. min-max works but alpha-beta and depth-limited do not. One sympton is that the computer won't block a losing move.
• Check the grade database to verify your grades. Use your student ID to login. e-mail your graders for any discrepancies.
• Exam 2 stats!
• The final exam will be a take-home and open-book.
• The Extra Credit Project is up!

COMP 212 introduces students to object-oriented program design and the fundamental algorithms and data structures of imperative programming. All programming assignments are done in the Java programming language. Several programming projects of moderate size will help students to learn

• how to design object-oriented programs using design patterns;
• how to choose appropriate data structures and algorithms that strike a balance between logical simplicity and performance; and
• how to write programs in stream-oriented and event-oriented style.

The exercises will involve common data structures such as lists, stacks, queues, search trees, syntax trees, and hash tables, and will use algorithms for sorting, searching, and graph traversal. Some exercises will involve writing programs driven by a graphics user interface (GUI).

Lab Sections