elz: (ada-tubes)
elz ([personal profile] elz) wrote in [community profile] intro_to_cs2009-11-11 10:52 pm
Entry tags:

Poll & solutions

First:

Open to: Registered Users, detailed results viewable to: All, participants: 25


Tickyboxes!

View Answers

Finished lecture 2
24 (96.0%)

Finished problem set 1
15 (60.0%)



Also, it occurs to me that it might be handy to have a place to post/discuss solutions to the problem sets, to see what we can learn from each other in the absence of TAs. If you actually go to MIT and the problem sets are still the same, don't read these. ;)

Fire away!
luckykitty: Cartoon avatar created on madmen site (Default)

[personal profile] luckykitty 2009-11-14 09:03 pm (UTC)(link)
Thank you for sharing your solution... My solution to problem 1 was really similar to yours! Except I didn't define it as a function, so had to include a flag for whether or not it was a prime and then test that afterwards. I really like having the function, as it makes it so much easier to read. Cool! *learns*

Could you also return True or False rather than 1 or 0, and then just test if is_prime is true? I guess it's six of one?
yhlee: Alto clef and whole note (middle C). (Default)

[personal profile] yhlee 2009-11-14 09:16 pm (UTC)(link)
Yes, I believe you could return True or False (boolean) instead of 1 or 0. I think my brain is stuck in some other programming language I learned earlier where booleans return as 1 or 0 so I reverted. Whoops. :-D

I am a great believer in helper functions--they let me break down the problem into chunks. ^_^