Talks
Speakers
Events
Topics
Sign in
Home
Talks
Speakers
Events
Topics
Leaderboard
Use
Analytics
Sign in
Suggest modification to this talk
Title
Description
RubyConf 2019 - Fun, Friendly Computer Science by Mercedes Bernard Computer science concepts like Big O Notation, set theory, data structures, and principles of object-oriented programming sound intimidating, but they don’t have to be! This talk will dive into some fundamental computer science topics and debunk the myth that only ‘real’ programmers know CS. Whether you are a code school grad, self-taught career switcher, or someone who, like me, didn't pay attention in night class, join me as we explore some computer science theory behind the code we write every day through fun illustrations and real-world examples. #confreaks #rubyconf2019
Date
Summarized using AI?
If this talk's summary was generated by AI, please check this box. A "Summarized using AI" badge will be displayed in the summary tab to indicate that the summary was generated using AI.
Show "Summarized using AI" badge on summary page
Summary
Markdown supported
In the talk "Fun, Friendly Computer Science" presented at RubyConf 2019 by Mercedes Bernard, the speaker aims to demystify foundational computer science concepts for audiences who may find them intimidating. The session covers seven key topics related to computer science in an approachable manner, especially valuable for individuals from non-traditional programming backgrounds. Here are the main points discussed throughout the talk: - **Introduction to the Speaker**: Mercedes Bernard is an experienced engineering manager and software engineer with a traditional computer science background. She emphasizes that deep knowledge is not always necessary in the field. - **Target Audience**: This beginner-level talk is designed for individuals with basic familiarity with loops, arrays, and classes regardless of their educational background. - **Understanding Big O Notation**: The speaker breaks down Big O notation, explaining its relevance in assessing algorithm efficiency, with everyday cooking analogies. For instance, she compares constant time (O(1)) to mixing butter regardless of quantity, and linear time (O(n)) to the time taken to mix eggs. - **Set Theory**: Using Venn diagrams, Mercedes illustrates basic set operations such as union, intersection, and set difference. She connects these concepts to practical applications in coding, such as SQL joins and website filtering. - **Recursion**: The metaphor of Russian nesting dolls is used to explain recursion, highlighting the importance of having a base case to prevent infinite loops. - **Object-Oriented Programming (OOP) Principles**: - **Encapsulation**: Hiding an object's state while providing a public interface. - **Abstraction**: Simplifying complex implementation details. - **Inheritance**: Sharing properties and methods among classes, like plants requiring sunlight and water. - **Polymorphism**: Allowing different classes to implement methods in varied ways while sharing the same interface. - **Conclusion and Resources**: Mercedes encourages attendees to recognize that understanding these concepts is essential for coding interviews and mentorship. She provides additional resources through shared slides and code samples to facilitate further learning. Overall, Bernard’s talk conveys that while these computer science concepts may seem daunting, with relatable illustrations and practical applications, they can be easily understood and utilized in everyday coding practices.
Suggest modifications
Cancel
