Scribd
Upload
53 views

5-Minute Break Introduction To Pset0 Until 2:30pm

The document outlines an introductory CS50 course schedule: - An introduction to CS50 will be provided until 2pm - A 5-minute break will follow - An introduction to problem set 0 (pset0) will continue until 2:30pm - Students attending a 2pm class can leave early and watch the rest online

Uploaded by

TerbinderGill
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
53 views

5-Minute Break Introduction To Pset0 Until 2:30pm

The document outlines an introductory CS50 course schedule: - An introduction to CS50 will be provided until 2pm - A 5-minute break will follow - An introduction to problem set 0 (pset0) will continue until 2:30pm - Students attending a 2pm class can leave early and watch the rest online

Uploaded by

TerbinderGill
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 97

introduction to CS50 until 2pm

5-minute break *

introduction to pset0 until 2:30pm

* if shopping 2pm class, aok to leave early; watch rest at cs50.harvard.edu

experimental screencast at screencast.cs50.net


Week 0
73% of CS50 students
have never taken CS before
what ultimately matters in this course is not so much
where you end up relative to your classmates but where
you, in Week 11, end up relative to yourself in Week 0
problem solving
inputs outputs
binary
0, 1
decimal
0, 1, 2, 3, 4, 5, 6, 7, 8, 9
123
100 10 1

123
100 10 1

123
100 1
100 10 1

123
100 1 + 10 2
100 10 1

123
100 1 + 10 2 + 13
100 10 1

123
100 + 20 + 3
123
000
4 2 1

000
4 2 1

001
4 2 1

010
4 2 1

011
4 2 1

100
4 2 1

101
4 2 1

110
4 2 1

111
42
50
ASCII

A B C D E F G H I ...
65 66 67 68 69 70 71 72 73 ...
72 73 33
H I !
72 73 33
H I !
72 73 33
H I !
72 73 33
72 73 33
72 73 33
abstraction
inputs outputs
algorithms
0 Stand up and think of the number 1.

1 Pair off with someone standing.


Add your numbers together.

2 One of you should then sit down.


If you're still standing, go back to step 1.
0 pick up phone book
1 open to middle of phone book
2 look at names
3 if Smith is among names
4 call Mike
5 else if Smith is earlier in book
6 open to middle of left half of book
7 go back to step 2
8 else if Smith is later in book
9 open to middle of right half of book
10 go back to step 2
11 else
12 quit
0 pick up phone book
1 open to middle of phone book
2 look at names
3 if Smith is among names
4 call Mike
5 else if Smith is earlier in book
6 open to middle of left half of book
7 go back to step 2
8 else if Smith is later in book
9 open to middle of right half of book
10 go back to step 2
11 else
12 quit
0 pick up phone book
1 open to middle of phone book
2 look at names
3 if Smith is among names
4 call Mike
5 else if Smith is earlier in book
6 open to middle of left half of book
7 go back to step 2
8 else if Smith is later in book
9 open to middle of right half of book
10 go back to step 2
11 else
12 quit
0 pick up phone book
1 open to middle of phone book
2 look at names
3 if Smith is among names
4 call Mike
5 else if Smith is earlier in book
6 open to middle of left half of book
7 go back to step 2
8 else if Smith is later in book
9 open to middle of right half of book
10 go back to step 2
11 else
12 quit
0 pick up phone book
1 open to middle of phone book
2 look at names
3 if Smith is among names
4 call Mike
5 else if Smith is earlier in book
6 open to middle of left half of book
7 go back to step 2
8 else if Smith is later in book
9 open to middle of right half of book
10 go back to step 2
11 else
12 quit
time to solve

size of problem
n
time to solve

size of problem
n n/2
time to solve

size of problem
n n/2
time to solve

log n

size of problem
This is CS50
cs50.ly/new
lectures

attend first

attend last
walkthroughs

most Wednesdays at 1pm

embedded in every problem set


problem sets

released on Fridays

due (10 days later) on Mondays at noon


take as first year?

take with other courses?


sections

less comfortable

more comfortable

somewhere in between
sections

Mondays

Tuesdays

Wednesdays
office hours

Mondays
Tuesdays
Wednesdays
Thursdays
Fridays
Saturdays
Sundays
office hours

Mondays
Tuesdays
Wednesdays
Thursdays
Fridays
Saturdays
Sundays
tutoring
CS50 Coding Contest
introduction to CS50 until 2pm

5-minute break *

introduction to pset0 until 2:30pm

* if shopping 2pm class, aok to leave early; watch rest at cs50.harvard.edu


introduction to CS50 until 2pm

5-minute break *

introduction to pset0 until 2:30pm

* if shopping 2pm class, aok to leave early; watch rest at cs50.harvard.edu


#include <stdio.h>

int main(void)
{
printf("hello, world\n");
}
functions
loops
variables
Boolean expressions
conditions
arrays
threads
events

You might also like