Presented by:
Georgia Gouros
Teacher Mathematics/Computer Science, Author, resident of Melbourne Australia.
Personal teaching philosophies: • I help students improve their reasoning, thinking and learning skills by engaging them through varied learning materials that connect theory to the real world. • I endeavour to motivate my students to become independent learners. • I provide a positive role model for lifelong learning.
My Website: https://sites.google.com/view/msgsvce
My Books:
- An Introduction to Algorithmic Thinking - Algorithmics (HESS) Student Guide https://www.flipsnack.com/988CA9F6AED/algorithmics-hess-textbook-preview.html
- Computer Science A-Z Sampler https://sites.google.com/view/msgsvce/a-z-of-computer-science
- Math Methods for :) sake! https://www.flipsnack.com/988CA9F6AED/math-methods-for-happy-sake-preview.html
Books available from:
Volunteer Hosts
Thanks for helping with Snap!Con 2022!
Audience: teachers and students (Year 9 to Year 12) Presenter: Georgia Gouros, Virtual School Victoria, Melbourne, Australia Website: https://sites.google.com/view/msgsvce/
Stacks, Queues, Priority Queues, Dictionaries and Graphs are very useful structures for storing complex information for solving problems. In this workshop session there is an introduction to Abstract Data Types (ADTs) and their standard operations and how these can be coded into your own Snap! library CATEGORY, followed by an exploration of how a Snap! Abstract Data Type Library can be used to model real world information.
- 1. Explain what ADTs are and their standard operations on data in algorithms (5 mins)
- 2a. Demonstrate how a Snap! CATEGORY ADT Library for Stacks & Queues can be coded using lists in Snap! (5 mins)
- 2b. Participants create a Snap! CATEGORY ADT Library with Stacks & Queues(10 mins) [pre-prepared solution available]
- 2c. Demonstrate how the ADTs Priority Queue and Dictionary can be added to the Snap! CATEGORY ADT Library (5 mins)
- 2d. Participants create blocks in Snap! CATEGORY ADT Library (10 mins) _[pre-prepared solution available] _
- 3a. Show how Priority Queues can be combined in a model in Snap! for a runway algorithm in outback Australia real world modelling problem (5 mins)
- 3b. Participants follow along and encode Priority Queues model and algorithm in Snap! (10 mins) [pre-prepared solution available]
- 4. Discussion on other applications of ADTS in Snap! and SnapApps/Edgy (10 mins) [pre-prepared examples available] conference organiser reference: https://snap.berkeley.edu/project?user=ggouros%40vsv.vic.edu.au&project=ALGO%20VSV%20Abstract%20Data%20Type%20Library%20with%20Examples
RESOURCES FOR PARTICIPANTS
- Step A Stacks & Queues in Snap! https://snap.berkeley.edu/project?user=ggouros%40vsv.vic.edu.au&project=A%20Snapcon22%20ADTs%20StackQueue
- Step B Stacks & Queues & PQ & DIct in Snap! https://snap.berkeley.edu/project?user=ggouros%40vsv.vic.edu.au&project=B%20Snapcon22%20ADTs%20StackQueuePQDict
- Step C Setup an airport in Snap! https://snap.berkeley.edu/project?user=ggouros%40vsv.vic.edu.au&project=C%20Snapcon22%20SetupAirport
- Step D Setup network library in Snap! https://snap.berkeley.edu/project?user=ggouros%40vsv.vic.edu.au&project=D%20Snapcon22%20ADTS%20Networks
- Step E using SnapApps/Edgy with built in graph network libraries and collections https://snapapps.github.io/ http://snapapps.github.io/edgy/app/edgy.html
- Duration:
- 1 h
- Room:
- Room 3
- Conference:
- Snap!Con 2022
- Type:
- Workshop