You don’t need a Computer Science degree to be a good programmer. In fact, some of the best programmers out there are folks with no formal CS training!

But this doesn’t mean that the knowledge and the topics covered in a CS degree are not useful. In fact, your typical Computer Science degree covers quite a bit of theory that is useful and applicable to common programming tasks.

Don't miss your chance to join both of our presenters for a hands-on, interactive review session! In this invite-only meeting, held after the final seminar in this series, we'll review and discuss the core concepts covered in each session. We'll make sure that there are no gaps in your understanding and discuss practical applications of these topics to your real-world use-cases.  
 

This session is available only to "VIP Package" ticket holders. 
Space is limited; get your ticket today!  

In this session, we will discuss (and apply) abstract idea drawn from the topic of computational complexity theory to the very practical topic of writing fast, efficient code. We’ll offer and expand upon the common ”Big-O” and Bachmann-Landau-driven framing from asymptotic analysis and see how this affects the code that we write every day.

In this session, we will discuss the theory underlying trees and graphs. We’ll limit ourselves to modeling these structures (fairly inefficiently) using NetworkX and focus on the various operations and algorithms that can be encoded in terms of this structure.

In this session, we will discuss the most popular interview question (that probably tells us the least about the candidate): dynamic programming! We’ll discuss what dynamic programming is all about and present a framework for approaching these problems effectively.

In this bonus session, we will discuss topics drawn from symbolic, propositional, and binary logic and see how they apply to actual problems in our work.