HTW Berlin |
Tentative Schedule |
KW |
Date | Lecture |
Lab |
||||
---|---|---|---|---|---|---|---|
Tuesdays WH C 12.15-13.45 |
Wednesdays WH C 348 12.15-13.45 |
Group 1 |
Group 2 Tues. WH C 537 14.00-15.30 |
||||
41 |
08.10. | Introduction to the course |
09.10. | Client/Server concept Networking in Java (URLReader)
|
Dealing with Objects | ||
42 |
15.10. | File-based IO |
16.10. | GUIs
|
Chatterbox | ||
43 |
22.10. | Properties
of Algorithms |
23.10. | Maximum Contiguous Subsequence Sum |
Histogram | ||
44 |
29.10. | Abstraction:
|
30.10. | Design Patterns Lists |
Execution times |
||
45 |
05.11. | More lists
|
06.11. | Sets (Set - SetAsList - SetTest) Bags
|
Abstract Data Types | ||
46
|
12.11. | Stacks |
13.11. | Queues (Underflow.java - TestQueue.java - ArrayQueue.java - LinkedQueue.java - If time: more Java AWT |
There will be a new Exercise 4.5 (no pre-lab) this week, all other exercises have been moved down one week! Programming in the small
|
||
47 | 19.11. | ADTs and the Julian Date How to Solve It (Polya) |
20.11. | Random numbers Probabilistic Algorithms |
Fun with Calculators 1 |
||
48
|
26.11. | I am giving a talk for the HRK You can sit in the lecture room and read: What every computer scientist needs to know about floating point numbers and the article |
27.11. | Recursion
|
The 9:45 group meets without me Reverse Polish Notation |
||
49 | 03.12. | Permutations (Handout on Permutations), Backtracking (TicTacToe.java) |
04.12. | AVL-Trees Tries |
Fun with Calculators 2 | ||
50
|
10.12. | Graphs |
11.12. | Graph Algorithms |
Fun with Calculators 3 | ||
51
|
17.12. |
|
18.12. | Finite State Automata
|
Recursive Triangles | ||
52/ 1 | Christmas Vacation | ||||||
2
|
07.01. | Heapsort (Handout-heap - Heapsort.java) Searching |
08.01. | String Searching |
Getting from A to B | ||
3
|
14.01. | Hashing |
15.01. | NP-Complete Problems |
Scrabble Cheater, Basic Edition |
||
4
|
21.01. | Coding Algorithms |
22.01. | Unicode Cryptographic Algorithms |
Scrabble Cheater, Deluxe Edition | ||
5
|
28.01. | Exam review |
29.01. | Exam in C 340 |
Vacation fun: |
||
6
|
05.02. | Return of exam |
14 | Vacation fun: Ladders |
Things we might do if we have time:
Scanning and Parsing Algorithms 1
Scanning and Parsing Algorithms 2
Enumerations (Main - Card - ShuffleAndDeal)
Collections - - Iterators
,
Last change: 2020-01-22 12:09 |