Tal's CS Blog
יום ראשון, 11 במרץ 2012
Chapters 7 and 8
›
-7.2 1.ok 2.parallel circuit... 3.no idea 4.ok. 5.A and B 6.Not A and B 7.Series of all 3. 8.huh? 9.A and B or Not A and B 10.ok ...
Chapters 5 and 6
›
Chapter 5 Exercises -5.2 1.18 2.10(a+b)-(a+b)=9a 3.don't get it 4.120,220 5.16,60 6.156 7.2222 8.113 9.220,112 10.ends with ...
יום שני, 13 בפברואר 2012
Programming in Python Chapters 3+4
›
3.2 Exercises 1. r=5 p=3.141592 area=p*r**2 2.10 3.name, d7, 2x, first_name, lastName, Amt 4.firstName='Tal' lastName='Z...
יום שלישי, 7 בפברואר 2012
Programming in Python Chapters 1+2
›
1.2 Exercises 1.empty set, {a}, {a,b}, {b} 2.7, 25(?), n!+1(?) 3.f(x)=2x for 0<x<6 4.Can't really think of one, but I'm p...
יום שני, 12 בדצמבר 2011
Hash Tables, Maps, and Sets
›
8_1 No 8_2 Arraylists. Maybe queues, but that's pushing it. 8_3 you could have a temp which checks all the objects in a queue, an...
יום שני, 28 בנובמבר 2011
Queues & Heaps
›
QUEUES & HEAPS Queues 7_1 Yes it works in the FIFO behavior. 7_2 Using implementation of LinkedLists is ideal because they are very fl...
Binary Trees 2
›
6_6
›
דף הבית
הצג את הגירסה לאינטרנט