This event is going to be a general overview of basic data structures, their applications, and fun facts. We will go over concepts such as Big O notation, Stacks/Queues, Trees, Heaps, Graphs.
Mar 12, 2021, 11:00 PM – Mar 13, 2021, 12:30 AM
About this event
Any successful programmer, sooner or later, needs to learn algorithms and data structures. Many interviews at tech companies like Google require you to have knowledge of these concepts. Do not hesitate to join this event to step on the way to becoming tech savvy!
This event series consists of 3 parts:
Algorithms and Data Structures overview
Common Sorting Algorithms
Graph Traversal and Pathfinding
This series is dedicated to making you familiar with basic algorithms and data structures. During the first event, we will learn what Big O notation, Stacks/Queues, Trees, Heaps, and Graphs are.
Basic programming concepts
No prior algo or data structures knowledge required
March 12 – 13, 2021 11:00 PM – 12:30 AM UTC
Go over the structure of the event series.
Big O notation
We will learn how to assess the efficiency of your code using Big O notation. We will talk about different algorithm complexities and how to calculate them.
This section is about Stacks, Queues, Heaps and their real-world applications.
Graphs and Trees
We will learn what Graphs and Trees are and what computer science areas use them extensively.
Q & A
It’s time for all of your questions you had during the session!