Weekly notes / Slides
| Week | 45 | 46 | 47 | 48 | 49 | 50 | 51 |
|---|---|---|---|---|---|---|---|
| Weekly notes | 04.11.2011 | 11.11.2011 | 18.11.2011 | 25.11.2011 | 02.12.2011 | 07.12.2011 | 07.12.2011 |
| Slides | 07.11.2011 | 14.11.2011 16.11.2011 | 21.11.2011 | 28.11.2011 30.11.2011 | 05.12.2011 | 12.12.2011 14.12.2011 | 19.12.2011 |
| Programs | CalcPanel (win) | ListNode (win) LinkedList (win) List (win) ListOfInt (win) PartialArrayListOfInt (win) DynamicArrayListOfInt (win) ListTest (win) |
Stack (win) LinkedStack (win) ArrayListStack (win) DynamicArrayStack (win) Queue (win) LinkedQueue (win) ArrayListQueue (win) RingQueue (win) |
SortTree (win) BinSortTree (win) ArrayListTree (win) RecursiveList (win) RecursiveBinTree (win) BinTree (win) BinTreeNode (win) MTreeADT (win) MTreeNode (win) MTree (win) |
MyClient (win) MyServer (win) ChatClient (win) ChatServer (win) Counter (win) MultiServer (win) |
Project
Information about the re-exam project is available in the re-exam project description. Supporting files for the re-exam project are available by clicking here.
Information about the second part of the project is available in the project description #2.
The files Game.java, GUI.java, TTTGame.java, GameTree.java, GameTreeDisplay.java, GUIPanel.java, and TTTExplorer.java are available by clicking on the respective links or by going to this directory.
Information about the first part of the project is available in the project description #1.
The files CLI.java, Coordinate.java, GUI.java, Game.java, TTTBoard.java, TTTGame.java, TicTacToe.java, and UserInterface.java are available by clicking on the respective links or by going to this directory.
Schedule
| Week | 45 | 46 | 47 | 48 | 49 | 50 | 51 |
|---|---|---|---|---|---|---|---|
| Mon 12-14 (U20) | Lecture | Lecture | Lecture | Lecture | Lecture | Lecture | Lecture |
| Tue 10-12 (U23a) | Lab M1 | ||||||
| Tue 14-16 (U49d) | Exercise S2 | Exercise S2 | Exercise S2 | Exercise S2 | |||
| Wed 10-12 (U20) | Lecture | Lecture | Lecture | ||||
| Wed 10-12 (U49d) | Exercise S17 | Exercise S17 | Exercise S17 | Exercise S17 | |||
| Wed 12-14 (U10) | Exercise S7 | Exercise S7 | Exercise S7 | Exercise S7 | |||
| Wed 12-14 (U23a) | Exercise M1 | Exercise M1 | Exercise M1 | Exercise M1 | |||
| Thu 08-10 (U69) | Lab S17 | Lab S17 | Lab S17 | Lab S17 | Lab S17 | Lab S17 | Lab S17 |
| Thu 10-12 (U49b) | Lab S2 | Lab S2 | Lab S2 | Lab S2 | Lab S2 | Lab S2 | Lab S2 |
| Thu 14-16 (U49b) | Lab S7 | Lab S7 | Lab S7 | Lab S7 | Lab S7 | Lab S7 | Lab S7 |
| Fri 10-12 (U14) | Lab M1 | Lab M1 | Lab M1 | Lab M1 | Lab M1 | Lab M1 |
Office Hours
Just come to my office. If you want to make sure I'm there, contact me before (by e-mail, jabber, phone).
- Office: IMADA, Ø13-602b-2 (map)
- Phone: 6550 2327
- E-mail: petersk@imada.sdu.dk
- Home page: http://www.imada.sdu.dk/~petersk/
- Jabber: petersk@jabber.dk
Literature
Obligatory course book (available as PDF and HTML):
David J. Eck: Introduction To Programming Using Java, Version 6.0, Lulu, 2011.
Supplementary Reading (available as PDF and HTML):
Course Description
Prerequisites:
The material in DM502 Programming A should be known.
Evaluation:
Project divided into parts and integrated in the course. Pass/fail, no external examinator.
Re-exam after fourth quarter.
Withdrawal date:
Withdrawal from the exam must be 7 days before the first exam date.
Course type:
22 lectures (45 minutes each), 14 exercises sessions and supervised project work (6 hours). (The hours stated are indicative and deviations may occur).
Teaching period:
2nd quarter, fall 2011
Aims:
To give the student the following qualifications.
Synopsis:
- object oriented programming techniques
- recursion
- examples of abstract data types and their realization
Aims:
After the course, the student is expected to be able to:
- design and implement object-oriented models for concrete problems
- design and implement recursive solutions of problems
- design and implement abstract data types
- use basic tree structures and algorithms for these
- describe basic measures of program runtime, illustrated by sorting algorithms
- describe and use adequate elements of the program library