Recitation Logs 2013b

Recitation logs appear under the different tabs.

General

Number	Topics	joint material	Comments
1	Introduction, Python basics: variables, conditionals, loops	-	-
2	More loops, lists, functions	-	-
3	Binary numbers, Complexity and time measurements, Python's memory model	-	-
4	Complexity and O notation, Diffie Hellman protocol	-	-
5	Object Oriented Programming, recursion	-	-
6	Recursion	-	-
7	High order function (and lambda expressions) class Matrix	-	-
8	hash, repeated substring problem	-	We also solved HW3 Q4 sections b+c
9	Data structures: linked lists, iterators and generators	-	-
10	String match: Karp-Rabin and DFA	-	-
11	Text compression: Huffman	-	We also solved k_select from HW4 and the "reality" question from HW5
12	Text compression: Lempel-Ziv Image Processing	-	-
13	Image noise reduction (denoising) Error correction codes	-	-
14	Leftovers, Summary.	-	-

Yoav

Number	Log	Comments
1	HTML PDF Source	Updated 28.2
2	HTML PDF Source	Updated 11.3
3	HTML PDF Source	Updated 13.3 noon
4	HTML Source	Updated 3.4 Probability that a number is prime
5	HTML Source	Updated 15.4. [Special method names in classes
6	HTML Source
7	HTML Source	Updated 29.4 with Matrix code
8	HTML Source
9	HTML Source
10	HTML Source
11	HTML Source
12	HTML Source
13	HTML Source
14	HTML Source

Amir

Number	Log	Comments
1	week_schedule.py count.py log1_noon.txt log1_eve.txt	py files are the versions from the evening recitation
2	collatz.py above_avg.py max.py is_perfect.py log2_noon.txt log2_eve.txt	sum_divisors in perfect.py intentionally contains a bug! try to fix.
3	convert_base.py is_perfect.py (with timings) memory_model.py log3_noon.txt log3_evening.txt balloons.zip (images of class whiteboard)	Python tutor (webtool for simulations of python's memory: http://www.pythontutor.com/
4	Diffie_Hellman.py log4_evening.txt	log is from evening recitation. Look at what happened when cracking Diffie Hellman the first time - the secret found was not Alice's original a !
5	OOP_geometry.py log5_noon.txt log5_evening.txt recursive_max.py	link to special method names in classes Something to think about before next recitation: in recursive_max.py, we analyzed the number of recursive calls for each function (both were O(n) calls). Then I said time complexity is O(n), since each call takes O(1). But I cheated on you. what's incorrect? what's the correct claim, and how does it affect complexity? I expect some good answers next time…
6	recursive_max.py binom.py change.py change_tree.pdf log6_noon.txt log6_evening.txt	The quicksort code is in the lectures area
7	matrix.py log7_noon.txt log7_evening.txt
8	hash.py log8_evening.txt	Only the evening log survived (due to the TA's careless attempt to print a 10**5 long string…)
9	reverse_list.pdf LinkedLists.py Qimplementation.pdf Queue.py iter_gener.py log9_noon.txt log9_evening.txt	1. We will finish generators next time. 2. In the noon recitation, running times of queue implementations were very weird. However, later in the evening recitation the numbers were perfect (look at the logs). This will probably remain a mystery…
10	Karp_Rabin.py DFA.pptx log10_noon.txt log10_evening.txt
11	huffman.py song_texts.zip log11_noon.txt log11_evening.txt	Solutions to HW4's k_select Solutions to HW5's "reality" question
12	LZ.py images.py updated 8/6 matrix.py guess.jpg log12_noon.txt log12_evening.txt	In images.py there are 3 more functions which we did not have time for in class - left for you to play with: upside_down, append, stretch.
13	bounded_local_medians.py	Don't forget to put these files in the current directory: images.py and matrix.py from the last recitation, and noise.py from the lectures.
14	quine.py