Slide 1

AlgorithmsHomeworkNoneLectures & Homework Solutions:https://jshare.johnshopkins.edu/kchurch4/public_html/teaching/103/ Video:http://ocw.mit.edu/OcwWeb/Electrical-Engineering-and-Computer-Science/6-046JFall-2005/VideoLectures/detail/embed03.htm Next Week: Mid-TermOpen everything: book / laptop / notes / networkOld Business

CFGs: Context Free Grammars (Ch8)

AmbiguityThe Chomsky HierarchyType 0 > Type 1 > Type 2 > Type 3Recursively Enumerable > CS > CF > RegularExamplesType 3: Regular (Finite State):Grep & Regular ExpressionsRight-Branching: A a ALeft-Branching: B B bType 2: Context-Free (CF): Center-Embedding: C x C yParenthesis Grammars: ( )w wRType 1: Context-Sensitive (CS): w wType 0: Recursively EnumerableBeyond Type 0: Halting Problem

New Business

http://ocw.mit.edu/OcwWeb/Electrical-Engineering-and-Computer-Science/6-006Spring-2008/LectureNotes/index.htm

Hash Tablesn stepsn stepsLinear TimeConstant Timen2 timen timehttp://ocw.mit.edu/ans7870/6/6.006/s08/lecturenotes/files/docdist1.py http://ocw.mit.edu/ans7870/6/6.006/s08/lecturenotes/dd_prog4.htm Profiling

O(n)