[ Daily | Alphabetically ]

Topics

Topics
Luger6
Luger5
Weiss3
Ullman2
Elmasri4
Elmasri6
deBerg3
 Web links
21 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
23 Aug W/1 234-trees, Red-black trees 12.2 2-3-4 tree; Red-black tree
28 Aug M/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)
30 Aug W/2 Red-black tree deletion cases
06 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
11 Sep M/4 Probability, Bayes' Law 5.2, 5.4 5.2, 5.4 Conditional probability; Joint probability; Bayes theorem
13 Sep W/4 Bayes nets 9.3 9.3 Bayesian inference
18 Sep M/5 Project 2 design, Using maps 4.8 map in C++; Map in Java
20 Sep W/5 Naïve Bayes, Information retrieval, Precision and recall Information retrieval; Precision and recall; Naive Bayes classifier; Chain rule
25 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
27 Sep W/6 Paper prototyping Paper prototyping
02 Oct M/7 Design tradeoffs, UI evaluation criteria, UI standards and guidelines Usability testing; Best practices in GUI design; List of UI style guides
04 Oct W/7 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
09 Oct M/8 Dijkstra's algorithm 9.3.2 Dijkstra's algorithm; Dijkstra example (graphical); Dijkstra example (good pseudocode, great data trace)
11 Oct W/8 Using priority queues, A and A* 4.2, 4.3 4.2, 4.3 Admissibility; A*; Dijkstra's and A*; priority_queue in C++; PriorityQueue in Java
16 Oct M/9 Implementing best-first search, Using hash tables, Writing hash functions unordered_set in C++; HashSet in Java; Hash functions; hash in C++; hashCode() in Java
18 Oct W/9 Project design work, Stateful comparators
23 Oct M/10 Problem spaces 3.1.3 3.1.3 State space search
25 Oct W/10 Problem spaces, cont'd, Minimax, Alpha-beta pruning 4.4, 4.4.3 4.4, 4.4.3 Minimax; Minimax in AI/games (don't miss link to part 2); Alpha-beta pruning; Branch and bound; Alnilam (game)
30 Oct M/11 Assorted review, Heuristics, take 2 (minimax)
01 Nov W/11 Nature of intelligence, Database components 16.1 17.1 1.2 2.4 2.4 Turing test; Chinese room; ELIZA; Turing, A.M. (1950). Computing machinery and intelligence. Mind, 59, 433-460.; How Machines Learn (CGP Grey); Database
06 Nov M/12 Relational models 3.1 5.1 3.1 Relational database; Relation; Examples of CREATE/INSERT
08 Nov W/12 SQL 6.1, 6.5 8.1, 8.4 4.1, 4.3 SQL; SQL syntax (SQLite dialect); SQL query semantics
13 Nov M/13
20 Nov M/14 Entity-relationship models, Database design principles, Database security, Database constraints, Database correctness (ACID), Distributing databases 7.1, 7.2, 2.1, 2.2, 1.2.4 5.2, 8.2, 3.3, 3.4, 12.2, 17.3, 23.1, 23.2 3.2, 4.2, 7.3, 7.4, 10.2, 21.3, 24.1, 24.2 Database constraints; E-R model; Database transaction; ACID; Shard; No SQL; Database security; "Exploits of a Mom" (Little Bobby Tables)
27 Nov M/15 Computational geometry, Convex hulls, Convex hulls cont'd, Algorithm analysis 1.2, 1.3, 1.1 Computational geometry; Convex hull
29 Nov W/15 Line segment intersection, Doubly-connected edge lists 2.1, 2.2, 2.3 Line segment intersection; Doubly connected edge list