presentation tips

162
Presentationtips Marco D’Ambros

Upload: marco-dambros

Post on 19-Aug-2014

12.933 views

Category:

Education


0 download

DESCRIPTION

A useful guide on how to prepare, design, and deliver effective and communicative presentations

TRANSCRIPT

Page 1: Presentation tips

PresentationtipsMarco D’Ambros

Page 2: Presentation tips

95% of presentations SUCK

“”—Guy Kawasaky

Page 3: Presentation tips

—Guy Kawasaky

OK, maybe I’m exaggerating.“”It is actually 99%

99%

1%

suck

don’t suck

Page 4: Presentation tips

Examples?

Ok, but be prepared for what follows

Page 5: Presentation tips
Page 6: Presentation tips
Page 7: Presentation tips
Page 8: Presentation tips
Page 9: Presentation tips
Page 10: Presentation tips

Death by Powerpoint

Page 11: Presentation tips

Preparation Design Delivery

Page 12: Presentation tips

Preparation Design Delivery

Page 13: Presentation tips

Preparing a 30-slide presentation takes 36-90 hours

”—Nancy Duarte

Page 14: Presentation tips

Start with the goal

What is the message?

Page 15: Presentation tips

Know youraudience

Page 16: Presentation tips

Simplify

to the essential(but not more)

Page 17: Presentation tips

—John Maeda

Simplicity is aboutsubtracting the obvious,and adding the meaningful

Page 18: Presentation tips

—John Maeda

More appears like lesssimply moving it far, far away

“”

Page 19: Presentation tips

Get alone

Page 20: Presentation tips

Multitasking, when it comes to paying attention, is a myth

We are biologically incapable of processing attention-rich inputs simultaneously”

—Dr. Medina

Page 21: Presentation tips

People who are interrupted:

50%Make

moreerrors

50%Take

longer tocomplete a task

Page 22: Presentation tips

Being always onlineis being always distracted and

unproductive

Page 23: Presentation tips

You need time off the grid to prepare

Page 24: Presentation tips

Go analog

Use post-it

Page 25: Presentation tips

Use whiteboard

Page 26: Presentation tips

Brainstorming andmind mapping

Page 27: Presentation tips

If you are stuck go for a walk or a run...just move!

Page 28: Presentation tips

If you are stuck go for a walk or a run...just move!

why?

Page 29: Presentation tips

How the brain works in 12 rules

Exercise boost brain power

Rule #1

By Dr. Medina

Page 30: Presentation tips

Examples of anti-brain environmentsaccording to Dr. Medina

Page 31: Presentation tips

Lecture hall

Page 32: Presentation tips

Classroom

Page 33: Presentation tips

Office

Page 34: Presentation tips

Exercise is not just good for general health, it actuallyimproves cognition

Page 35: Presentation tips

Exercise increases oxygen flow into the brain, which reduces brain-bound free radicals [...] an increase in oxygen is always accompanied by an uptick in mental sharpness.

Exercise acts directly on the molecular machinery of the brain itself. It increases neurons’ creation, survival, and resistance”

—Dr. Medina

Page 36: Presentation tips

Even more benefits!

• Reduces depression

• Treats dementia

• Improves reasoning

• Improves long-term memory

• Improve fluid intelligence

• Helps you solve problems

• and more...

Page 37: Presentation tips

If you are stuck go for a walk or a run...just move!

Page 38: Presentation tips

Your audience will haveto seat and listen

think from their perspective

Page 39: Presentation tips

Create a scalable structure

Page 40: Presentation tips

5min

presentation

solutionkey point

key point

key point

Page 41: Presentation tips

15min

presentation

solutionkey point

explanation

explanation

explanation

Page 42: Presentation tips

45min

presentation

key pointexplanation

detail

detail

detail

Page 43: Presentation tips

Create thestory

Page 44: Presentation tips

We do not pay attention to boring things

Rule #4

If keeping someone’s attention in a lecture was a business, it would have an 80% failure rate.

”— Dr. John Medina

Page 45: Presentation tips

Good stories are:

Page 46: Presentation tips

simple

Page 47: Presentation tips

Concre

te

Page 48: Presentation tips

Credible

Page 49: Presentation tips

Emotional

Page 50: Presentation tips

• story

• exposition

• conflict & climax

• resolution

How should the story be?

exposition

conflict & climax

resolution

Page 51: Presentation tips

• pick another perspective

Take another perspective

Page 52: Presentation tips

In the beginner’s mind there are many possibilities, in the expert’s mind there are few

—Shunryu Suzuki

Adopt a beginner’s mind

Page 53: Presentation tips

Preparation Design Delivery

Page 54: Presentation tips

Common mistakes

Page 55: Presentation tips

People tend to put every word they are going to say on their PowerPoint slides. Although this eliminates the need to memorize your

talk, ultimately this makes your slides crowded, wordy, and boring. You will loss your

audience’s attention before you even reach the bottom of your ...

1. T E L E P R O M P T I N G

Slide from Don McMillan, “Life After Death by PowerPoint”: http://bit.ly/aYxegN

Page 56: Presentation tips

2. Spelling mistakes

Many people do not run spel cheek before there presentation

BIG MISTAK!!! Nothing makes you lok stupder than speling erors

Slide from Don McMillan, “Life After Death by PowerPoint”: http://bit.ly/aYxegN

Page 57: Presentation tips

3. Bullet pointing

Slide from Don McMillan, “Life After Death by PowerPoint”: http://bit.ly/aYxegN

• Avoid• Excesive• Buller-Pointing• Only• Bullet• Key• Points• Too• Many

• Bullet-Points• And• Your• Key• Messages• Will• NOT• Stand• Out

Page 58: Presentation tips

4. Too many levels

• What is worst

• Too many bullet point levels are shown

• Type size gets smaller and smaller

• Until it is utterly unreadable

• Even for audiences in the 4th row

• So you better have just one bulletpoint level

• Better yet, forget about bullets (bullets, not guns, kill people. Don’t you know?)

• Use them sparingly

• There are many other ways of detailing your ideas!

Slide from Don McMillan, “Life After Death by PowerPoint”: http://bit.ly/aYxegN

Page 59: Presentation tips

5. Color schemes gone wrong

• Distraction• Confusion • Headache• Nausea• Vomiting• Loss of bladder control

schemesbadcolor

canlead to...

Slide from Don McMillan, “Life After Death by PowerPoint”: http://bit.ly/aYxegN

Page 60: Presentation tips

6. Stick to the default template

Page 61: Presentation tips

7. Use things people won’t understand

In the fist time interval t1, we have a total of 4 changes,and the change frequencies of the files (i.e., their probabilityof change) are pA = 2

4 , pB = 14 , pC = 1

4 . The entropy in t1is therefore H = �(0.5 ⇥ log2 0.5 + 0.25 ⇥ log2 0.25 + 0.25 ⇥log2 0.25) = 1. In the second time interval t2 the entropy ishigher: H = �( 2

7 ⇥log227 + 1

7 ⇥log217 + 4

7 ⇥log247 ) = 1.378. In

addition, we take into account the amount of change per fileby measuring the size of change (lines added and/or deleted).Hassan also defined the Adaptive Sizing Entropy as:

H 0 = �nX

k=1

pk ⇥ logn̄ pk (2)

where n is the number of files in the system and n̄ is thenumber of recently modified files. To compute the set of re-cently modified files we use previous periods (e.g., modifiedin the last six time intervals), whereas also time can be used(e.g., modified in the last six months). To use the entropyof code change as bug predictor, Hassan defined the Historyof Complexity Metric (HCM) of a file j as

HCM{a,..,b}(j) =X

i2{a,..,b}

HCPFi(j) (3)

where {a, .., b} is a set of evolution periods and HCPF isdefined as:

HCPFi(j) =

⇢cij ⇥H 0

i, j ⇤ Fi

0, otherwise(4)

where i is a period with entropy H 0i, Fi is the set of files mod-

ified in the period i and j is a file belonging to Fi. Accordingto the definition of cij , there are three types of HCM :

1. (1) cij = 1, every file modified in the considered periodi gets the entropy of the system in the considered timeinterval. This defines approach HCM.

2. (2) cij = pj , each modified file gets the entropy of thesystem weighted with the probability of the file beingmodified, defining WHCM.

3. (3) cij = 1|Fi|

the entropy is evenly distributed to allthe files modified in the i period. We do not use thisdefinition since Hassan showed that it performs lesswell than the other.

Concerning the periods used for computing the History ofComplexity Metric, we use fixed time intervals of two weeks.

Variants. We define three further variants based onHCM, with an additional weight for periods in the past.In EDHCM (Exponentially Decayed HCM) , entropies forearlier periods of time, i.e., earlier modifications, have theircontribution reduced exponentially over time, modelling anexponential decay model. EDHCM was introduced by Has-san. Similarly, LDHCM (Linearly Decayed) and LGDHCM(LoGarithmically decayed), have their contributions reducedover time in a respectively linear and logarithmic fashion.Both are novel. The definition of the variants follow:

EDHCM{a,..,b}(j) =P

i2{a,..,b}HCPFi(j)

e�1⇥(|{a,..,b}|�i) (5)

LDHCM{a,..,b}(j) =P

i2{a,..,b}HCPFi(j)

�2⇤(|{a,..,b}|+1�i) (6)

LGDHCM{a,..,b}(j) =P

i2{a,..,b}HCPFi(j)

�3⇤ln(|{a,..,b}|+1.01�i)(7)

where �1, �2 and �3 are the decay factors.

4.5 Churn of Source Code MetricsUsing churn of source code metrics to predict post release

defects is a novel approach that we propose. The idea isthat higher-level metrics may better model code churn thansimple metrics like addition and deletion of lines of code.The idea is to sample the history of the source code everytwo weeks and to compute the deltas of source code metricsfor each consecutive pair of samples. To do so, we first haveto create “delta matrices”, one per each source code metrics,by performing the following steps:

1. We check out one version of the system from the CVSrepository for each two weeks time interval, and parsethe source code of every version and, for each class,compute the CK+OO source code metrics.

2. For each source code metric, we create a matrix wherethe rows are the classes, the columns are the sampledversions, and each cell is the value of the metric forthe given class at the given version. If a class does notexist in a version, we indicate that by using a defaultvalue of -1. We only consider the classes which existat release x for the prediction.

3. We generate a matrix of deltas, where each cell is theabsolute value of the di�erence between the values ofa metric for a class in two subsequent version. If theclass does not exist in one of the two versions (or bothof them), i.e., at least one value is -1, then we use thedefault value of -1 also for the delta.

10Class Foo

Class Bar 42

Class Bas -1

2 weeks

Release X

50

32

50

22

70

22

48

40

10 15

Version from

1.1.2005

Version from

15.1.2005

Version from

29.1.2005

Time

10

-1

0

10

5

Figure 5: Computing metrics deltas from versionsof a software system sampled every two weeks.

Figure 5 shows an example of deltas matrix computa-tion for three classes. The numbers in the squares arethe values of the metrics in the corresponding versionsof the system, while the numbers in the circles are thedeltas.

Once we have computed the deltas matrices for each sourcecode metric, we compute the churn measures as follows:

CHU(i) =CX

j=1

⇢0, deltas(i, j) = �1PCHU(i, j), otherwise

(8)

PCHU(i, j) = deltas(i, j) (9)

where i is the index of a row in the deltas matrix (corre-sponding to a class), C is the number of columns of the ma-trix (corresponding to the number of samples considered),

In the fist time interval t1, we have a total of 4 changes,and the change frequencies of the files (i.e., their probabilityof change) are pA = 2

4 , pB = 14 , pC = 1

4 . The entropy in t1is therefore H = �(0.5 ⇥ log2 0.5 + 0.25 ⇥ log2 0.25 + 0.25 ⇥log2 0.25) = 1. In the second time interval t2 the entropy ishigher: H = �( 2

7 ⇥log227 + 1

7 ⇥log217 + 4

7 ⇥log247 ) = 1.378. In

addition, we take into account the amount of change per fileby measuring the size of change (lines added and/or deleted).Hassan also defined the Adaptive Sizing Entropy as:

H 0 = �nX

k=1

pk ⇥ logn̄ pk (2)

where n is the number of files in the system and n̄ is thenumber of recently modified files. To compute the set of re-cently modified files we use previous periods (e.g., modifiedin the last six time intervals), whereas also time can be used(e.g., modified in the last six months). To use the entropyof code change as bug predictor, Hassan defined the Historyof Complexity Metric (HCM) of a file j as

HCM{a,..,b}(j) =X

i2{a,..,b}

HCPFi(j) (3)

where {a, .., b} is a set of evolution periods and HCPF isdefined as:

HCPFi(j) =

⇢cij ⇥H 0

i, j ⇤ Fi

0, otherwise(4)

where i is a period with entropy H 0i, Fi is the set of files mod-

ified in the period i and j is a file belonging to Fi. Accordingto the definition of cij , there are three types of HCM :

1. (1) cij = 1, every file modified in the considered periodi gets the entropy of the system in the considered timeinterval. This defines approach HCM.

2. (2) cij = pj , each modified file gets the entropy of thesystem weighted with the probability of the file beingmodified, defining WHCM.

3. (3) cij = 1|Fi|

the entropy is evenly distributed to allthe files modified in the i period. We do not use thisdefinition since Hassan showed that it performs lesswell than the other.

Concerning the periods used for computing the History ofComplexity Metric, we use fixed time intervals of two weeks.

Variants. We define three further variants based onHCM, with an additional weight for periods in the past.In EDHCM (Exponentially Decayed HCM) , entropies forearlier periods of time, i.e., earlier modifications, have theircontribution reduced exponentially over time, modelling anexponential decay model. EDHCM was introduced by Has-san. Similarly, LDHCM (Linearly Decayed) and LGDHCM(LoGarithmically decayed), have their contributions reducedover time in a respectively linear and logarithmic fashion.Both are novel. The definition of the variants follow:

EDHCM{a,..,b}(j) =P

i2{a,..,b}HCPFi(j)

e�1⇥(|{a,..,b}|�i) (5)

LDHCM{a,..,b}(j) =P

i2{a,..,b}HCPFi(j)

�2⇤(|{a,..,b}|+1�i) (6)

LGDHCM{a,..,b}(j) =P

i2{a,..,b}HCPFi(j)

�3⇤ln(|{a,..,b}|+1.01�i)(7)

where �1, �2 and �3 are the decay factors.

4.5 Churn of Source Code MetricsUsing churn of source code metrics to predict post release

defects is a novel approach that we propose. The idea isthat higher-level metrics may better model code churn thansimple metrics like addition and deletion of lines of code.The idea is to sample the history of the source code everytwo weeks and to compute the deltas of source code metricsfor each consecutive pair of samples. To do so, we first haveto create “delta matrices”, one per each source code metrics,by performing the following steps:

1. We check out one version of the system from the CVSrepository for each two weeks time interval, and parsethe source code of every version and, for each class,compute the CK+OO source code metrics.

2. For each source code metric, we create a matrix wherethe rows are the classes, the columns are the sampledversions, and each cell is the value of the metric forthe given class at the given version. If a class does notexist in a version, we indicate that by using a defaultvalue of -1. We only consider the classes which existat release x for the prediction.

3. We generate a matrix of deltas, where each cell is theabsolute value of the di�erence between the values ofa metric for a class in two subsequent version. If theclass does not exist in one of the two versions (or bothof them), i.e., at least one value is -1, then we use thedefault value of -1 also for the delta.

10Class Foo

Class Bar 42

Class Bas -1

2 weeks

Release X

50

32

50

22

70

22

48

40

10 15

Version from

1.1.2005

Version from

15.1.2005

Version from

29.1.2005

Time

10

-1

0

10

5

Figure 5: Computing metrics deltas from versionsof a software system sampled every two weeks.

Figure 5 shows an example of deltas matrix computa-tion for three classes. The numbers in the squares arethe values of the metrics in the corresponding versionsof the system, while the numbers in the circles are thedeltas.

Once we have computed the deltas matrices for each sourcecode metric, we compute the churn measures as follows:

CHU(i) =CX

j=1

⇢0, deltas(i, j) = �1PCHU(i, j), otherwise

(8)

PCHU(i, j) = deltas(i, j) (9)

where i is the index of a row in the deltas matrix (corre-sponding to a class), C is the number of columns of the ma-trix (corresponding to the number of samples considered),

In the fist time interval t1, we have a total of 4 changes,and the change frequencies of the files (i.e., their probabilityof change) are pA = 2

4 , pB = 14 , pC = 1

4 . The entropy in t1is therefore H = �(0.5 ⇥ log2 0.5 + 0.25 ⇥ log2 0.25 + 0.25 ⇥log2 0.25) = 1. In the second time interval t2 the entropy ishigher: H = �( 2

7 ⇥log227 + 1

7 ⇥log217 + 4

7 ⇥log247 ) = 1.378. In

addition, we take into account the amount of change per fileby measuring the size of change (lines added and/or deleted).Hassan also defined the Adaptive Sizing Entropy as:

H 0 = �nX

k=1

pk ⇥ logn̄ pk (2)

where n is the number of files in the system and n̄ is thenumber of recently modified files. To compute the set of re-cently modified files we use previous periods (e.g., modifiedin the last six time intervals), whereas also time can be used(e.g., modified in the last six months). To use the entropyof code change as bug predictor, Hassan defined the Historyof Complexity Metric (HCM) of a file j as

HCM{a,..,b}(j) =X

i2{a,..,b}

HCPFi(j) (3)

where {a, .., b} is a set of evolution periods and HCPF isdefined as:

HCPFi(j) =

⇢cij ⇥H 0

i, j ⇤ Fi

0, otherwise(4)

where i is a period with entropy H 0i, Fi is the set of files mod-

ified in the period i and j is a file belonging to Fi. Accordingto the definition of cij , there are three types of HCM :

1. (1) cij = 1, every file modified in the considered periodi gets the entropy of the system in the considered timeinterval. This defines approach HCM.

2. (2) cij = pj , each modified file gets the entropy of thesystem weighted with the probability of the file beingmodified, defining WHCM.

3. (3) cij = 1|Fi|

the entropy is evenly distributed to allthe files modified in the i period. We do not use thisdefinition since Hassan showed that it performs lesswell than the other.

Concerning the periods used for computing the History ofComplexity Metric, we use fixed time intervals of two weeks.

Variants. We define three further variants based onHCM, with an additional weight for periods in the past.In EDHCM (Exponentially Decayed HCM) , entropies forearlier periods of time, i.e., earlier modifications, have theircontribution reduced exponentially over time, modelling anexponential decay model. EDHCM was introduced by Has-san. Similarly, LDHCM (Linearly Decayed) and LGDHCM(LoGarithmically decayed), have their contributions reducedover time in a respectively linear and logarithmic fashion.Both are novel. The definition of the variants follow:

EDHCM{a,..,b}(j) =P

i2{a,..,b}HCPFi(j)

e�1⇥(|{a,..,b}|�i) (5)

LDHCM{a,..,b}(j) =P

i2{a,..,b}HCPFi(j)

�2⇤(|{a,..,b}|+1�i) (6)

LGDHCM{a,..,b}(j) =P

i2{a,..,b}HCPFi(j)

�3⇤ln(|{a,..,b}|+1.01�i)(7)

where �1, �2 and �3 are the decay factors.

4.5 Churn of Source Code MetricsUsing churn of source code metrics to predict post release

defects is a novel approach that we propose. The idea isthat higher-level metrics may better model code churn thansimple metrics like addition and deletion of lines of code.The idea is to sample the history of the source code everytwo weeks and to compute the deltas of source code metricsfor each consecutive pair of samples. To do so, we first haveto create “delta matrices”, one per each source code metrics,by performing the following steps:

1. We check out one version of the system from the CVSrepository for each two weeks time interval, and parsethe source code of every version and, for each class,compute the CK+OO source code metrics.

2. For each source code metric, we create a matrix wherethe rows are the classes, the columns are the sampledversions, and each cell is the value of the metric forthe given class at the given version. If a class does notexist in a version, we indicate that by using a defaultvalue of -1. We only consider the classes which existat release x for the prediction.

3. We generate a matrix of deltas, where each cell is theabsolute value of the di�erence between the values ofa metric for a class in two subsequent version. If theclass does not exist in one of the two versions (or bothof them), i.e., at least one value is -1, then we use thedefault value of -1 also for the delta.

10Class Foo

Class Bar 42

Class Bas -1

2 weeks

Release X

50

32

50

22

70

22

48

40

10 15

Version from

1.1.2005

Version from

15.1.2005

Version from

29.1.2005

Time

10

-1

0

10

5

Figure 5: Computing metrics deltas from versionsof a software system sampled every two weeks.

Figure 5 shows an example of deltas matrix computa-tion for three classes. The numbers in the squares arethe values of the metrics in the corresponding versionsof the system, while the numbers in the circles are thedeltas.

Once we have computed the deltas matrices for each sourcecode metric, we compute the churn measures as follows:

CHU(i) =CX

j=1

⇢0, deltas(i, j) = �1PCHU(i, j), otherwise

(8)

PCHU(i, j) = deltas(i, j) (9)

where i is the index of a row in the deltas matrix (corre-sponding to a class), C is the number of columns of the ma-trix (corresponding to the number of samples considered),

Page 62: Presentation tips

Design the zen way

simplicity

clarity

uncluttered

Page 63: Presentation tips

Design right-brain slides

Page 64: Presentation tips

Design rightbrain slides

Page 65: Presentation tips

Be visual

Page 66: Presentation tips

Vision trumps all other senses

Rule #10

Page 67: Presentation tips

We have a better recall

for visual information

Page 68: Presentation tips

IRSYMCAWTFIBMKGBFBI

we are wired to pattern”—Dr. Medina“

Page 69: Presentation tips

IRSYMCAWTFIBMKGBFBI

we are wired to pattern”—Dr. Medina“

Page 70: Presentation tips

Visual information are easier to remember

Oral

Visual

Oral &Visual

10%

35%

65%

3x6x

Source: Najjar, LJ (1998) Principles of educational multimedia user interface design (via Brain Rules by John Medina, 2008)

Page 71: Presentation tips

decoratedon’t

slides

communicationadd

values

Page 72: Presentation tips

90freshwater

%

of the

in the world is

Slide from Garr Reynolds: http://www.slideshare.net/garr/sample-slides-by-garr-reynolds

90of the

in our

%

planet isfreshwater

Inspired by www.slideshare.net/garr/sample-slides-by-garr-reynolds

Page 73: Presentation tips

ice

Source: SCAR

iceInspired by www.slideshare.net/garr/sample-slides-by-garr-reynolds

Page 74: Presentation tips

90 of the ice in our planet %

Antarcticais in

Inspired by www.slideshare.net/garr/sample-slides-by-garr-reynolds

Page 75: Presentation tips

Antarctic

of the world’s freshwater80

Source: SCAR

%

is ice in the

Slide from Garr Reynolds: http://www.slideshare.net/garr/sample-slides-by-garr-reynolds

80 of our planet’s freshwater%

Antarcticis ice in the

Inspired by www.slideshare.net/garr/sample-slides-by-garr-reynolds

Page 76: Presentation tips

Eat onlyuntil80% full

Bring your message visually

Page 77: Presentation tips

Eat onlyuntil80% full

Bring your message visually

Page 78: Presentation tips

foxy sad happy

angryundecidedsmiley

Use faces

Page 79: Presentation tips

Find beauty

Slide from Christina Quick : http://www.slideshare.net/ChrisQuick/new-rules-for-power-point-presentations

Page 80: Presentation tips

Dramatize

Slide from Christina Quick : http://www.slideshare.net/ChrisQuick/new-rules-for-power-point-presentations

Page 81: Presentation tips

2% of theworld

wealth50%owns

of the

Use metaphorical image

Slide from Christina Quick : http://www.slideshare.net/ChrisQuick/new-rules-for-power-point-presentations

Page 82: Presentation tips

The poorest 50% of the world

owns 1% of the wealth

Slide from Christina Quick : http://www.slideshare.net/ChrisQuick/new-rules-for-power-point-presentations

Page 83: Presentation tips

66% of Americansare obese or overweight.

All adults (66%)

Women 65 million   (62%)

Men 69 million   (71%)

134 million

OECD Factbook 2007

Be provocative

Slide from Garr Reynolds: http://www.slideshare.net/garr/sample-slides-by-garr-reynolds

Page 84: Presentation tips

Text and fonts

No more than 2-3 types

Page 85: Presentation tips

Text and fonts

use color and size to build contrast

Page 86: Presentation tips

Text and fonts

Blinking, sparkling, or twirling text is just not cool

Page 87: Presentation tips

Rotation can make the slide more

interesting, but don’t overdo it

Text and fonts

Page 88: Presentation tips

Reduce to the maxText is redundant

People cannot listen andread at the same time

Page 89: Presentation tips

Simplicity means the achievement of maximum effect with minimum means

—Dr. Koichi Kawana”

Use quotes

Page 90: Presentation tips

Design principles

Page 91: Presentation tips

11 po

int

per

slid

e

Page 92: Presentation tips

Contrast

Repetition

Alignment

Proximity

Design principles

Page 93: Presentation tips

Contrast

Page 94: Presentation tips

R e p e t i t i o n

Repetition examples

Repetition of design elements gives a

cohesive look

Slide from Jesse Desjardins: http://www.slideshare.net/jessedee/steal-this-presentation-5038209

Page 95: Presentation tips

Alignment

Page 96: Presentation tips

Proximity

Page 97: Presentation tips

no templatesor

the following one

Page 98: Presentation tips
Page 99: Presentation tips

Rule of third

Page 100: Presentation tips

Use color properly

Page 101: Presentation tips

Black: is all about elegance

White: is about trust

Page 102: Presentation tips

Apply a contrasting color palette

Page 104: Presentation tips

Do not forget that 7-10% ofpeople are color-blind

Page 105: Presentation tips

Use images properly

Page 106: Presentation tips

Do not useUgly clip art

Small images

Watermarked images

Distorted images

Page 107: Presentation tips

Go full quality

Page 108: Presentation tips

Have a neutralbackground

Page 109: Presentation tips

Make images transparent

oruse

Page 110: Presentation tips

Where to get good images?

www.istockphoto.com (pay)

Page 111: Presentation tips

Where to get good images?

google images

Page 112: Presentation tips

Where to get good images?

sxc.hu (free)

Page 113: Presentation tips

Do not omit the credits

Image from irishfireside.com

Page 114: Presentation tips

Be consistentStick to your settings

Page 115: Presentation tips

avoid clutter: make more slides

a slide costs 0$

Page 116: Presentation tips

use empty space

Page 117: Presentation tips

This is different from...

Page 118: Presentation tips

... this

Page 120: Presentation tips

Make the data memorable

Page 121: Presentation tips

2005 2007 2008

11M

9M

2M

World of Warcraft users worldwide

Not memorable

Page 122: Presentation tips

1.4 times the swiss population

World of Warcraft users worldwide

Page 123: Presentation tips

Facebook users

800Mil l ions

Not memorable

Page 124: Presentation tips

307M

800M

1,170M

1,333M

World most populated countries

800M

Page 125: Presentation tips

iPod capacity

5 GB

vs

1,000 songs

Page 126: Presentation tips

Break the rules, but do it sparingly

Slide from Eduardo S. de la Fuente: http://www.slideshare.net/eduardo.delafuente/the-art-of-presentation-following-the-zen-path-why

Page 127: Presentation tips

Some before/after examplesby presentation guru Garr Reynolds

Page 128: Presentation tips

before

after

Slide from Garr Reynolds: www.slideshare.net/garr/sample-slides-by-garr-reynolds

Page 129: Presentation tips

before

after

Slide from Garr Reynolds: www.slideshare.net/garr/sample-slides-by-garr-reynolds

Page 130: Presentation tips

before

after

Slide from Garr Reynolds: www.slideshare.net/garr/sample-slides-by-garr-reynolds

Page 131: Presentation tips

before

after

Slide from Garr Reynolds: www.slideshare.net/garr/sample-slides-by-garr-reynolds

Page 132: Presentation tips

before

after after

Slide from Garr Reynolds: www.slideshare.net/garr/sample-slides-by-garr-reynolds

Page 133: Presentation tips

before

after

Slide from Garr Reynolds: www.slideshare.net/garr/sample-slides-by-garr-reynolds

Page 134: Presentation tips

before

after

Slide from Garr Reynolds: www.slideshare.net/garr/sample-slides-by-garr-reynolds

Page 135: Presentation tips

Preparation Design Delivery

Page 136: Presentation tips

RehearseRehearseRehearseRehearse

RehearseRehearseRehearseRehearse

RehearseRehearseRehearseRehearse

Page 137: Presentation tips

Spend some time in the light table view

Page 138: Presentation tips

• show your passion

Show your passion

Page 139: Presentation tips

Introduce yourself

Page 140: Presentation tips

Start strong

Page 141: Presentation tips

Be confident

Page 142: Presentation tips

Keep it shortAudience attention steadily drops after 10 minutes

Page 143: Presentation tips

Minutes of class time

10 20 30 40 50

High

Low

Attention

The 10-minute rule

Source: www.brainrules.net/attention

Source: www.brainrules.net/attention

The 10-minutes rule

Attention

Minutes of class time

Page 144: Presentation tips

at each 10-minute markto regain attention

do something

emotionally relevant

Page 145: Presentation tips

End on a high note

Page 146: Presentation tips

Move away from the podium

audience

youlaptop

screen

Page 147: Presentation tips

• use the presenter view

Use a remote

Page 148: Presentation tips

Make

Page 149: Presentation tips

Make

pauses

Page 150: Presentation tips

• do not apologize

Do notapologize

Page 151: Presentation tips

Use Keynote presenter display

actually no

Page 152: Presentation tips

BRem

embe

r th

e B

key

Page 153: Presentation tips

Make good eyecontact

Page 154: Presentation tips

• keep the lights on

Keeplightson

Page 155: Presentation tips

Be prepared

Check the beamer beforehand

Page 156: Presentation tips

55%7% 38%

Body language matters

content voicebody language

Page 157: Presentation tips

Be slightly more elegant than the audience

Page 158: Presentation tips

Preparation Design Delivery

Always recap

Page 159: Presentation tips

Share your work

www.slideshare.net

speakerdeck.com

Page 160: Presentation tips

www.ted.com

Resources

www.garrreynolds.com

Page 161: Presentation tips

Brain RulesTakeaways & Quotes

from Dr. John Medina’s

What all presenters need to know

A presentation (of sorts)

by Garr Reynolds

Sample slidesHere are a few before/after slides

Garr Reynolds

http://slidesha.re/fausgs

http://slidesha.re/8Ykmry

http://slidesha.re/3mMo3c

http://slidesha.re/i8QMa

Credits

SEMINAR (I)

Alberto de Vega Eduardo S. de la Fuente

Zen Rocks by Lane Pierce

Following the ZEN path

http://slidesha.re/17P2Hh

Page 162: Presentation tips

Marco D’AmbrosComputer science researcher

Marco earned a PhD in Informatics from the University of Lugano (Switzerland), and MSc degrees from both Politecnico di Milano (Italy) and the University of Illinois at Chicago (USA).

His research interests lie in software engineering, software evolution, and software visualization. He authored more than 30 technical papers, and is the creator of several software visualization and program comprehension tools.

Marco is passionate about presentations: He distilled his experience, gained by giving more than 30 talks at international conferences, in this presentation.

www.linkedin.com/in/dambros

www.slideshare.net/marcodambros

twitter.com/marquitodambros

www.inf.usi.ch/phd/dambros/ On the Evolution ofSource Code andSoftware Defects

amzn.com/1460953568