[ Daily | Alphabetically ]

Topics

Topics
Luger6
Luger5
Weiss3
Ullman2
Elmasri4
Elmasri6
deBerg3
 Web links
25 Aug M/1 Introduction, Data independence, Physical data storage, B-trees 4.7 2.2, 13.1, 14.3 2.2, 17.1, 18.3 Data independence; B-tree
27 Aug W/1 234-trees, Red-black trees 12.2 2-3-4 tree; Red-black tree
03 Sep W/2 Red-black tree implementation cases Slides on 234/RB insertion cases; RB insertion and deletion with 234 correspondences (English is imperfect but examples are very good); RB insertion (with examples)
08 Sep M/3 Red-black tree deletion cases
10 Sep W/3 Tries, Huffman coding, Information theory, Compression, Lossy compression 10.1.2 Huffman coding; Information theory; Run-length encoding; Lossy data compression; Trie
15 Sep M/4 Probability, Bayes' Law 5.2, 5.4 5.2, 5.4 Conditional probability; Joint probability; Bayes theorem
17 Sep W/4 Bayesian inference 9.3 9.3 Bayesian inference
22 Sep M/5 Project 2 design, Using maps 4.8 map in C++; Map in Java
24 Sep W/5 Naïve Bayes, Information retrieval, Precision and recall Information retrieval; Precision and recall; Naive Bayes classifier; Chain rule
29 Sep M/6 User interfaces, UI perception and cognition, Affordances, Feedback, Diversity and accessibility User interface; User interface design; Affordance; Web accessibility; The Supreme Court, Domino's, and web accessibility for the visually impaired
01 Oct W/6 Paper prototyping Paper prototyping
06 Oct M/7 Design tradeoffs, UI evaluation criteria, UI standards and guidelines Usability testing; Best practices in GUI design; List of UI style guides
08 Oct W/7
13 Oct M/8 Graphs, Pathfinding, Brute-force search 3.1, 3.2 3.1, 3.2 9.1, 9.3.1, 9.6 Graph; Tree; Depth-first search; Breadth-first search; Iterative deepening depth-first search; Iterative deepening vs depth-first search
15 Oct W/8 Dijkstra's algorithm, Using priority queues 9.3.2 Dijkstra's algorithm; Dijkstra example (graphical); Dijkstra example (good pseudocode, great data trace); priority_queue in C++; PriorityQueue in Java; queue.PriorityQueue in Python
20 Oct M/9 A and A*, Implementing best-first search, Using hash tables 4.2, 4.3 4.2, 4.3 Admissibility; A*; Dijkstra's and A*; unordered_set in C++; HashSet in Java
22 Oct W/9 Writing hash functions, Stateful comparators Hash functions; hash in C++; hashCode() in Java
27 Oct M/10 Project design work
29 Oct W/10 Problem spaces, Minimax 3.1.3, 4.4 3.1.3, 4.4 State space search; Minimax; Minimax in AI/games (don't miss link to part 2)
03 Nov M/11 Alpha-beta pruning, Assorted review, Heuristics, take 2 (minimax), Nature of intelligence 16.1, 4.4.3 17.1, 4.4.3 Turing test; Chinese room; ELIZA; Turing, A.M. (1950). Computing machinery and intelligence. Mind, 59, 433-460.; How Machines Learn (CGP Grey); Alpha-beta pruning; Branch and bound
05 Nov W/11 Database components, Relational models 3.1 1.2 2.4, 5.1 2.4, 3.1 Database; Relational database; Relation; Examples of CREATE/INSERT
10 Nov M/12 SQL 6.1, 6.5 8.1, 8.4 4.1, 4.3 SQL; SQL syntax (SQLite dialect); SQL query semantics
12 Nov W/12 SQL cont'd, Entity-relationship models 2.1, 2.2 3.3, 3.4 7.3, 7.4 E-R model
17 Nov M/13 Project design work
24 Nov M/14 Database design principles, Database security, Database constraints, Database correctness (ACID), Distributing databases 7.1, 7.2, 1.2.4 5.2, 8.2, 12.2, 17.3, 23.1, 23.2 3.2, 4.2, 10.2, 21.3, 24.1, 24.2 Database constraints; Database transaction; ACID; Shard; No SQL; Database security; "Exploits of a Mom" (Little Bobby Tables)
01 Dec M/15 Computational geometry, Convex hulls, Convex hulls cont'd, Algorithm analysis 1.2, 1.3, 1.1 Computational geometry; Convex hull
03 Dec W/15 Line segment intersection, Doubly-connected edge lists 2.1, 2.2, 2.3 Line segment intersection; Doubly connected edge list