"OSCON 2018: A 10-ish step program for great tech talks" is a PDF drawn from the Internet Archive and catalogued under Computer Science for Undergraduate / College. From the source: Description: You know the code and the project. You’re doing lots of cool stuff. You have plenty of slides. So why is everyone in the audience reading their email? It doesn’t have to be that… Slide Collection preserves the upstream link, the original creator credit and the licensing terms; download the file to use it in a classroom, study group or revision plan.
About this presentation
Description: You know the code and the project. You’re doing lots of cool stuff. You have plenty of slides. So why is everyone in the audience reading their email? It doesn’t have to be that way. Great presenters are made, not born. The way to become a better speaker is through training, science, and practice. VM Brasseur teaches you the 10 (or so) steps to great tech talks. If you’ve never attended a speaker training before, you’ll see how much better your talks could be. If you have, you might pick up a few tips and ideas. And if you’re presenting at OSCON, this tutorial will give you some last-minute changes to tweak your talk. The steps include: Know your audience Have an idea Create a good proposal Tell a story Craft your presentation Practice your talk Get ready to speak Present yourself Deal with demo failure Interact with the audience Continue the conversation Slides: With speaker notes Without speaker notes
How to study this deck
Computer-science slides are deceptively dense. Code snippets and diagrams collapse hours of design decisions into a few lines, so resist the urge to skim. Run the snippets locally, change one variable, and observe what breaks.
Undergraduate viewers should treat this as a scaffolding for deeper reading — the slides outline the territory, but the textbook chapters and primary sources remain the actual content.
Five questions to test your understanding
- What is the single most important claim on the first three slides, and what evidence is offered for it?
- Which slide could you remove without losing the argument? Which slide is load-bearing?
- Where does the deck switch from definitions to applications? Mark that transition.
- What would a student who already disagreed with the conclusion need to see to be convinced?
- Which two slides, if combined, would give the clearest one-slide summary of the whole deck?
Where this deck fits in the wider catalogue
Slide Collection classifies this presentation under Computer Science, alongside other openly-licensed material in the same subject. If you are preparing a unit at the Undergraduate / College level, the dedicated combined Computer Science · Undergraduate / College page is the fastest way to find adjacent decks with the same audience in mind.
Citation & reuse
If you reuse material from this deck in your own teaching or coursework, please cite the original source on the Internet Archive and check the license attached to the file before redistribution. Slide Collection links to the upstream source on every detail page so the original creator and licensing terms are always one click away.