Hide menu

TDDC32 Design and implementation of a software module in Java

Lectures


Preliminary lecture plan with associated reading from the course book by Goodrich/Tamassia (GT). Lecture slides will be uploaded here during the course.

The visualisation tool used to demonstrate certain data structures can be found here.

Lecture 1

Course administration.
Search trees: AVL Trees.
GT 10.1-10.2
AVL-tree applet
Slides
Voluntary homework problem and solution sketch

Lecture 2

Search trees: Multi Way search trees, Splay trees.
GT 10.3-10.4, 14.3
(2.4)-tree applet, B-tree applet
Splay Tree applet (choose simple in the mennu where none os chosen at the start to se the key values)
Slides
Voluntary homework problem and solution sketch

Lecture 3

ADT Map, Hash Tables, ADT Dictionary. Skip Lists.
GT 9.1-9.5.
Lafore's Separate-Chaining Hash Table
Lafore's Linear-Probe Hash Table
Lafore's Quad/Double Hash Table
Hashing Animation Tool
Skip List Applet
Slides
Voluntary homework problem and solution sketch

Lecture 4

Threads.
Networking.
Code snippets from lecture
Slides
Voluntary homework problem and solution sketch

Lecture 5

Java GUI programming.
JDBC connections.
Code snippets from lecture
Slides
Voluntary homework problem and solution sketch

Lecture 6

OOAD - Development Process and Analysis.
Slides

Lecture 7

OOAD - From Analysis to Design.
Slides
Voluntary homework problem and solution sketch

Lecture 8

OOAD - Design Phase Details. Testing.
Slides


 


Page responsible: Tommy Färnqvist
Last updated: 2013-02-26