Seminar: Recreational Computer Science 3. How to Prepare a (Seminar) - - PowerPoint PPT Presentation

▶
seminar recreational computer science
SMART_READER_LITE
LIVE PREVIEW

Seminar: Recreational Computer Science 3. How to Prepare a (Seminar) - - PowerPoint PPT Presentation

Oct 08, 2022 753 likes •1.06k views

Seminar: Recreational Computer Science 3. How to Prepare a (Seminar) Presentation Gabi R oger Universit at Basel October 2, 2017 Getting Started Structure Slides Presentation Style Most lectures are bad models for seminar

slide-1
SLIDE 1

Seminar: Recreational Computer Science

  • 3. How to Prepare a (Seminar) Presentation

Gabi R¨

  • ger

Universit¨ at Basel

October 2, 2017

slide-2
SLIDE 2

Getting Started Structure Slides Presentation Style

Most lectures are bad models for seminar presentations.

slide-3
SLIDE 3

Getting Started Structure Slides Presentation Style

Discuss in groups of 2-3 and take notes:

What makes the difference between a good and a bad seminar presentation?

(3 minutes)

slide-4
SLIDE 4

Getting Started Structure Slides Presentation Style

Outline

1

Getting Started

2

Structure

3

Slides

4

Presentation Style

slide-5
SLIDE 5

Getting Started Structure Slides Presentation Style

1

Getting Started

2

Structure

3

Slides

4

Presentation Style

slide-6
SLIDE 6

Getting Started Structure Slides Presentation Style

Audience

You Audience Who is the audience? How large is it? What do they already know? What should they learn?

slide-7
SLIDE 7

Getting Started Structure Slides Presentation Style

Frame Conditions

time and duration size of room presentation equipment

  • ther presentations

. . .

slide-8
SLIDE 8

Getting Started Structure Slides Presentation Style

Define the Main Message

35 minutes is short focus on one main message/topic motivate and explain it well

slide-9
SLIDE 9

Getting Started Structure Slides Presentation Style

1

Getting Started

2

Structure

3

Slides

4

Presentation Style

slide-10
SLIDE 10

Getting Started Structure Slides Presentation Style

Possible Structure

title page introduction

  • utline

activation of previous knowledge new information discussion conclusion/summary questions

slide-11
SLIDE 11

Getting Started Structure Slides Presentation Style

Title Page

content title name date/event presentation welcome the audience mention title/topic if not already part of your introduction

slide-12
SLIDE 12

Getting Started Structure Slides Presentation Style

Introduction

get attention of the audience motivating example (positive) provocation presentation of setting . . .

slide-13
SLIDE 13

Getting Started Structure Slides Presentation Style

Outline

structures the presentation for the audience recurring slides with current part highlighted alternative: advance organizer not always necessary Do not give a compact version of your talk!

slide-14
SLIDE 14

Getting Started Structure Slides Presentation Style

Activation of Previous Knowledge

get audience into the topic refresh what they probably already know connections to other presentations interactive component possible but takes time

slide-15
SLIDE 15

Getting Started Structure Slides Presentation Style

New Information main part of the presentation

slide-16
SLIDE 16

Getting Started Structure Slides Presentation Style

Discussion

experimental evaluation related work relation to previous knowledge

slide-17
SLIDE 17

Getting Started Structure Slides Presentation Style

Conclusion/Summary

take-home message

  • utlook (open questions, advanced topics)
slide-18
SLIDE 18

Getting Started Structure Slides Presentation Style

1

Getting Started

2

Structure

3

Slides

4

Presentation Style

slide-19
SLIDE 19

Getting Started Structure Slides Presentation Style

Example: Turing Machines I

Definition (Nondeterministic Turing Machine) A nondeterministic Turing machine is given by a 7-tuple M = Q, Σ, Γ, δ, q0, , E. Here Q is a finite non-empty set of states, Σ = ∅ is a finite input alphabet, Γ ⊃ Σ a finite tape alphabet, and δ : (Q \ E) × Γ → P(Q × Γ × {L, R, N}) is the transition function. State q0 ∈ Q is the start state, tape symbol ∈ Γ \ Σ is the blank symbol, and E ⊆ Q is the set of end states.

slide-20
SLIDE 20

Getting Started Structure Slides Presentation Style

Example: Turing Machines II

. . . b a c a c a c a . . . infinite tape read-write head

slide-21
SLIDE 21

Getting Started Structure Slides Presentation Style

Example: Turing Machines III

Definition (Nondeterministic Turing Machine) A nondeterministic Turing machine is given by a 7-tuple M = Q, Σ, Γ, δ, q0, , E with: Q finite non-empty set of states Σ = ∅ finite input alphabet Γ ⊃ Σ finite tape alphabet δ : (Q \ E) × Γ → P(Q × Γ × {L, R, N}) transition function q0 ∈ Q start state ∈ Γ \ Σ blank symbol E ⊆ Q end states

slide-22
SLIDE 22

Getting Started Structure Slides Presentation Style

Pictures and Illustrations

“A picture is worth a thousand words.” support of text additional information instead of text lightening the mood

slide-23
SLIDE 23

Getting Started Structure Slides Presentation Style

Slide Content

  • ne statement per slide

keywords instead of sentences use examples, pictures, illustrations experimental data: graphs often better than tables formal definitions only if necessary

slide-24
SLIDE 24

Getting Started Structure Slides Presentation Style

Style

default font size or larger colors for highlighting less is more careful usage of animations

slide-25
SLIDE 25

Getting Started Structure Slides Presentation Style

1

Getting Started

2

Structure

3

Slides

4

Presentation Style

slide-26
SLIDE 26

Getting Started Structure Slides Presentation Style

Style

speak clearly look to the audience (do not talk to the projection) do not read out your slides/notes stay on time

slide-27
SLIDE 27

Getting Started Structure Slides Presentation Style

Most lectures are bad models for seminar presentations?

slide-28
SLIDE 28

Getting Started Structure Slides Presentation Style

Questions Questions?