Entries tagged with lecture post

Entry tags:

Lecture 10 / PS 5 Reminder

Note:Apparently, MIT re-arranged the furniture a few weeks ago. If you've tried to follow the links in the online calendar that I created for this session or links in posts prior to the previous one, they will redirect you to the main page for this course.

Also, if you're still following the course, could you post a quick reply to this post and let me know whether you're up-to-date or whether we need to pause for a catch-up?

Links:

Lecture 10 (spans June 21–July 4, 2010):
- Divide and conquer methods, merge sort, exceptions (video)
- Handout (PDF)
Assignment
- PS5 (due July 4): PS5: Word games (PDF)
- ps5.py (Exercise template, problems 1-5)
- test_ps5.py (Unit tests)
- ps5_ghost.py (Exercise template, problem 6)
- Word list (Text file)

Entry tags:

Quiz 1, Lecture 9, PS5 Links

Links:

Quiz 1:
- Problems (PDF)
- Solutions (PDF)
Lecture 9 (spans June7–June20, 2010):
- Binary search, bubble and selection sorts (video)
- Handout (PDF)
Assignment
- PS5 (due July 4): PS5: Word games (PDF)
- ps5.py (Exercise template, problems 1-5)
- test_ps5.py (Unit tests)
- ps5_ghost.py (Exercise template, problem 6)
- Word list (Text file)

Entry tags:

Lecture 8 / PS4 Reminder

Links:

Lecture 8 (spans May 17–May 30, 2010):
- Complexity; log, linear, quadratic, exponential algorithms (video)
- Handout (PDF)
Assignment
- PS4 (due May 30): PS4 (PDF)
- ps4.py (Exercise template)

Entry tags:

Lecture 7 / PS4 Start

Links:

Lecture 7 (spans May 3–May 16, 2010):
- Lists and mutability, dictionaries, pseudocode, introduction to efficiency (video)
- Handout (PDF)
Assignment
- PS4 (due May 30): PS4 (PDF)
- ps4.py (Exercise template)

Entry tags:

Lecture 6 / PS 3 Reminder

Links:

Lecture 6 (spans April 19–May 2, 2010):
- Bisection methods, Newton/Raphson, introduction to lists (video)
- Handout (PDF)
Assignment
- PS3 (due May 2): PS3 (PDF)
- ps3_template.py (Exercise template)

Entry tags:

Lecture 7

Another slightly shorter lecture today, and we switch professors in the middle. \0/

( Video under the cut )

Entry tags:

Lecture 6

So, who thinks the other professor was better? I'm finding this guy harder to follow, though I did catch that computers can be wrong and paranoia is good.

Paranoia, paranoia everybody's coming to get me...

Er. ( Lecture video under the cut. )

I have to say, I understand the whole lists, appending lists, concatenating lists idea, but I'm not following the code. For the universities bit, what are all the raw_inputs there for? Is the for loop just there to show that appending lists is messy? And which line is the concatenate? Is it "Univs = Techs + Ivys"?

(Class handout is here, and I've pasted the relevant code section under the cut.)

( Click for the code! )

Entry tags:

Lecture 3

Well now, PS1 would have been a lot easier if I had watched this lecture first. I even went and checked the schedule again after I watched it, thinking that I must have misses something and gotten the due date wrong on the problem set. But no, it appears the problem sets are due the day of the lecture, and then the lecture hammers home the info in the problem set. Methinks, since I control when I "go" to lecture, that I'll be watching prior to doing my homework in the future. :D

Anyway, thanks to the very helpful explanations of

jetamors and

aranthe, I had no trouble understanding this lecture. What about the rest of you?

( The video is under the cut, as is a link to the class handout. )

If you haven't had a chance, go and vote in the poll from the PS1 post and have your say about whether and when we do the quizzes. Also, if you're confused, there is a *lot* of information in the comments on the last two posts! Read through that, and feel free to ask if you have more questions. :)

Entry tags:

Lecture 2

All right! Hopefully we've all successfully completed Problem Set 0 and are ready to tackle Lecture 2. Note that there is a handout associated with this lecture, and having it printed out before starting is a really helpful thing. Not that I had to stop and print it in the middle of lecture or anything...

Also, since our problem set numbers started with 0, I'm going to put up a post for PS1 this Friday. From that point on, problem sets will go up every other week.

( The lecture video is embedded under the cut )

I had one problem with this lecture, and I'm hoping you all can facilitate a light bulb moment. The code example with x, y and z, the fourth one down the page... I can't figure out what the bug was. Is it just because the statements aren't indented, or is there something else?

Entry tags:

lecture post

Lecture 5

Link to video and handout

( Floating point numbers, successive refinement, finding roots )

Poll #1798

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

View Respondents

Post-Thanksgiving Tickybox

View Answers

Finished lecture 5!
2 (100.0%)

(Got a bit of catching up to do myself after last week!)

Entry tags:

lecture post

Lecture 4

Link to video and handout + Problem set 3

( Decomposition and abstraction through functions; introduction to recursion )

Poll #1733

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

View Respondents

Revenge of the tickyboxes

View Answers

Finished lecture 4
6 (100.0%)

Finished problem set 3
1 (16.7%)

Also! I was thinking, Google Code has some handy code review and commenting features, and who doesn't love version control, right? *g* So I set up an intro-cs-dw Mercurial project over there. I've never actually used Mercurial before, but I like having excuses to learn new things.

To get set up:

1) Email or pm me or leave me a comment and I'll add you as a project committer.

2) Add a folder with your name on it and put your problem set solutions in there.

That way if you want to collaborate with someone or leave helpful feedback or read other people's code, it should be a little easier than using the DW comments.

Entry tags:

lecture post

Lecture 3

Link to video and handout + Problem set 2

( Common code patterns: iterative programs )

Poll #1725

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

View Respondents

How's it going?

View Answers

Finished lecture 3
9 (100.0%)

Finished problem set 2
3 (33.3%)

Entry tags:

lecture post

Lecture 2

( Operators and operands; statements; branching, conditionals, and iteration )

Problem set 1: Computing prime numbers, product of primes

This one's a little trickier, so feel free to comment if you run into any problems or want to brainstorm with other people!

(eta: having issues with poll, alas)

Entry tags:

lecture post

Lecture 1: off we go!

Summary: "Goals of the course; what is computation; introduction to data types, operators, and variables"

( Embedded video - you can also get it from iTunes )

( Problem Set 0 )

And a link back to the rest of the readings for the first three lectures.

And since being able to check off tickyboxes gives me a sense of accomplishment:

Poll #1651

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

View Respondents

Lecture 1

View Answers

Finished it!
38 (100.0%)

Problem Set 0

View Answers

Finished it!
38 (100.0%)