Distributed Computing Applications and Infrastructure Spring 2012

Week 1: Introduction; Data Representation

• Read: Brookshear 0.1, 0.3, 0.4, 1.4, 1.5, 1.8, 1.9
• Jan 17: Course Overview  [ppt]
• Lab: Object Oriented Programming 1 [ppt] [py]
• Jan 19: Binary and other Data Representations [ppt]

Week 2: Boolean Logic, Circuits, How a CPU Works

• Read: Brookshear 1.1, 2.1 – 2.4
• Read: Brookshear 6.1-6.5 (for a review of OO for lab)
• Jan 24: Boolean logic; Logic Gates [ppt] [A1 posted]
• Lab: Object Oriented Programming 2, Practice Binary
• Jan 26: How computers Work: The CPU, instruction sets [ppt]

Week 3: Algorithms

• Read: Brookshear 5.1 – 5.4
• Jan 31: Algorithms and Pseudocode [ppt]
• Lab: Review logic gates and CPU workings
• Feb 2: Math Review; Analysis of Algorithms [ppt] [A1 due; A2 posted]

Week 4: Analysis of Algorithms

• Read: Brookshear 5.6, 12.5
• Skim: http://en.wikipedia.org/wiki/Analysis_of_algorithms
• Skim: http://en.wikipedia.org/wiki/Big_O_notation
• Feb 7: Analysis of Algorithms continued [ppt]
• Lab: Review Math, Analysis of Algorithms
• Feb 9: Algorithm Analysis, Sorting [ppt] [A2 due on FRIDAY 2/10; A3 out]

Week 5: Data Structures 1

• exam 1 review topics
• Read: Brookshear 8.1 – 8.7
• Feb 14: Test Review; Intro to Data Structures [ppt]
• Lab: Test Review
• Feb 16: Test 1; Lists, Vectors [ppt]

Week 6: Data Structures 2

• Read: Brookshear 5.5, 5.6
• http://en.wikipedia.org/wiki/Stack_(data_structure)
• http://en.wikipedia.org/wiki/Queue (data_structure)
• http://en.wikipedia.org/wiki/Hash_table
• Feb 21: Go over exam; Stacks, Queues [ppt]
• Lab: Implement queues, lists, dictionaries
• Feb 23: Hash Tables [ppt]

Week 7: Data Structures 3

• http://en.wikipedia.org/wiki/Tree (data_structure)
• http://en.wikipedia.org/wiki/Binary_search_tree
• http://en.wikipedia.org/wiki/Heap (data_structure)
• Feb 28: Trees [ppt] [A3 due; A4 out]
• Mar 1: Trees, cont., Heaps [ppt]

Week 8: Data Structures 4

• http://en.wikipedia.org/wiki/Graph_(data_structure)
• Mar 6: Graphs [ppt]
• Mar 8: Advanced Trees, data structures on disk [ppt]

Week 9: Data Structures Practice

• http://en.wikipedia.org/wiki/Regular_expression
Python regular expressions howto
• Python regular expressions reference (for your information)
• Mar 13: Exam 2 Practice [ppt]
• Mar 15: Exam 2 Practice, continued [A4 due; A5 out]

Week 10: Regular Expressions

• Read: Brookshear 1.2, 1.3, 3.1 – 3.5
• March 20: Regular Expressions, Finite Automata [ppt]
• Mar 22: Test 2 Regular Expressions, cont [ppt]

— Spring Break! —

Week 11: Operating Systems, Software Engineering

• Read: Brookshear 7.1 – 7.9, 3.1 – 3.5
• Apr 3: Operating Systems [ppt]
• Apr 5: Guest Lecture: Dr. Armando Fox: SOA, SaaS

Week 12: Distributed Systems, Security

• Read: Brookshear 4.5, 12.6
• Apr 10: Guest Lecture: Sarah Sproehnle, Cloudera, on Hadoop/MapReduce [A5 due; A6 out]
• Apr 12: Guest Lecture: Prof. Dave Wagner on Web Security [pdf]

Week 13: Networking

• Read: Brookshear 3.5, 4.1 – 4.4
• http://en.wikipedia.org/wiki/Internet_protocol_suite
• http://en.wikipedia.org/wiki/Internet_Protocol
• http://en.wikipedia.org/wiki/Transmission_Control_Protocol
• Apr 17: Networking, HTTP and other Protocols [ppt]
• Apr 19: Web Search Engines, Distributed Computing Wrapup [ppt]

Week 14: Encryption; Review

• http://en.wikipedia.org/wiki/Computer_security
• http://en.wikipedia.org/wiki/Cryptography
• http://en.wikipedia.org/wiki/Symmetric_key_algorithm
• http://en.wikipedia.org/wiki/Public-key_cryptography
• http://en.wikipedia.org/wiki/Cryptographic_hash_function
• http://en.wikipedia.org/wiki/Digital_signature
• Apr 24: Guest Lecture: Prof. John Chuang [ppt] [A6 due; A7 out]
• Apr 26: Exam 3 Review

Week 15: RRR week

• May 1: Optional Review class
• May 3: No class [A7 due]

Week 16: Final Exam

• May 7 (10am-11am): Test 3