Page Styling shamelessly stolen from this great site.
Hiya I'm glipR / Jackson Goerner!
I currently tutor at Monash University, and also working at AfterPay as a Data Engineer
I speak English, Python, Javascript, and on I'm practicing C#, GLSL, and Kotlin.
My main interests are in mathematics, computer science, and education, and I naturally tend to find intersection between the three.
These interests fuel many of the ideas for my ongoing projects, checkout the Projects page to see that.
I've been a university tutor since 2020.
To disambiguate what is a very weird choice of name, university tutors run tutes/workshops, which are run in conjunction with lectures.
Depending on the faculty and year level, this can be as informal as being available to answer questions, and asking probing questions, to as formal as a high-school teacher might run a class; Working through problems, explaining concepts, etc.
FIT1008
FIT1008 covers the fundamentals of algorithms, including basic data structures, a semi-formal introduction to complexity analysis, sorting algorithms, and a few more complicated data structures like BSTs and Heaps
I was a TA for this unit from 2021-2023, and was Admin TA for the unit for 3 semesters. As part of this work I created lessons, assignments, and helped deliver/alter the content as the syllabus changed.
FIT1008
FIT1045
FIT1045 is the first introduction to the Computer Science degree. It mainly focuses on the basics of programming, introducing this through Python.
Taught in: October Semester of 2021.
FIT1045
MAST 20026
MAST20026 is a real analysis unit taught at UoM. It covers a introduction to proof methods, the reals through Dedekind cuts, and various results following from this about limits of sequences and series.
Taught in: 2021 S2
MAST20026
FIT2014
FIT2014 is called the Theory of Computation. It takes a whirlwind pass through Languages (Finite, Regular, Context Free, etc), Turing Machines, Computability / Decidability, and the "Complexity Zoo"
I was a TA for this unit in 2021 S2 and 2022 S2
FIT2014
FIT2004
FIT2004 continues on from FIT1008, cover more algorithms and data structures. This includes Dynamic Programming, Graph Algorithms, Network Flow with Circulation and Demands, and an intro to suffix tries/trees.
I was a TA for this unit in 2022 S1 and 2023 S1
FIT2004
MTH3170
MTH3170 is one of the capstone units at Monash, and builds many theorems about graphs from the ground up. This starts with the basics of Graph Theory, then continues to discuss algorithms and theorems on Matchings and Flows, then finishes by discussing planarity, colouring, Ramsey theory and the probabilistic method.
I was a TA for this unit in 2021 S2 and 2022 S2
MTH3170
MAT1830
MAT1830 is the introduction to discrete mathematics, with some particular focus on topics helpful for computer scientists. This touches on some basics of formal logic, number theory, combinatorics, and graph theory.
I was a TA for this unit in 2020 S2 and 2022 S1
MAT1830
MCPC
I help with writing the yearly ICPC-style programming competition held on campus.
Code Quest
Previously AIArena, this was a much more ambitious type of contest, where we create a game and teams write bots to play it.
This ran with great success in 2021, 2022 and 2023.
Language Lab
My first attempt at writing educational material that is interactive/visual first. Much of the Theory of Computation content is algorithmic/graphical and benefits greatly from interactive elements.
Features short video explainers, interactive games and problems, plus theory/practical questions.
Brains 4 Bots
A project to extend EV3Sim functionality to teach students Python through solving, not through textbooks.
Now retired, but the concepts live on in newer projects.
×
![Cover Art]()
×
Movies & TV Shows
×
Books
×
Music
×
Games