BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//American Young Coder - ECPv6.10.1.1//NONSGML v1.0//EN
CALSCALE:GREGORIAN
METHOD:PUBLISH
X-ORIGINAL-URL:https://www.ayclogic.com
X-WR-CALDESC:Events for American Young Coder
REFRESH-INTERVAL;VALUE=DURATION:PT1H
X-Robots-Tag:noindex
X-PUBLISHED-TTL:PT1H
BEGIN:VTIMEZONE
TZID:America/Los_Angeles
BEGIN:DAYLIGHT
TZOFFSETFROM:-0800
TZOFFSETTO:-0700
TZNAME:PDT
DTSTART:20250309T100000
END:DAYLIGHT
BEGIN:STANDARD
TZOFFSETFROM:-0700
TZOFFSETTO:-0800
TZNAME:PST
DTSTART:20251102T090000
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
DTSTART;TZID=America/Los_Angeles:20250715T133000
DTEND;TZID=America/Los_Angeles:20250715T143000
DTSTAMP:20260514T193550
CREATED:20250716T055158Z
LAST-MODIFIED:20250716T055158Z
UID:29724-1752586200-1752589800@www.ayclogic.com
SUMMARY:1:30 PM - Intro to Python - Bill
DESCRIPTION:Your HW:\n\nCreate a new file called july_15_StringHomework.py\n\nRead pages 20-23 from the python text book\n\nMake sure to copy all the code blocks\nYou don’t need to copy any of the code sections that start with >>>\n\nThose would be what goes in the shell\n\n\n\n\nIntroToPythonP20toP23
URL:https://www.ayclogic.com/event/130-pm-intro-to-python-bill-2/
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=America/Los_Angeles:20250715T173000
DTEND;TZID=America/Los_Angeles:20250715T183000
DTSTAMP:20260514T193550
CREATED:20250717T001642Z
LAST-MODIFIED:20250717T001642Z
UID:29730-1752600600-1752604200@www.ayclogic.com
SUMMARY:Scratch 1 – TUE 5:30 PM – Julian (Allison Substitute)
DESCRIPTION:Today We Did:\n\nFinished our Animal Race project.\n\nHomework:\n\nCreate a new Scratch project called Ask Gobo\nAdd a Gobo sprite\nAdd any background you like\nWhen the game starts (when the Green Flag is clicked)\, code Gobo to:\n\nHave a size of 250%\nSay “I can answer your yes-or-no questions” for 3 seconds\n\n\n\nIf you have any questions feel free to email Julian at jsaroufim@ayclogic.com
URL:https://www.ayclogic.com/event/scratch-1-tue-530-pm-julian-allison-substitute-2/
CATEGORIES:Scratch Class,Scratch Class Level 1
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=America/Los_Angeles:20250715T190000
DTEND;TZID=America/Los_Angeles:20250715T200000
DTSTAMP:20260514T193550
CREATED:20250716T010633Z
LAST-MODIFIED:20250716T010633Z
UID:29722-1752606000-1752609600@www.ayclogic.com
SUMMARY:7 PM – Intro to Competitive Programming – Darin
DESCRIPTION:What We Did Today:\n\nReviewed Recursion\nImplemented the Fibonacci Function using Recursion\nLearnt about Memoization\n\nHomework:\nSubmit into the google drive here when you are finished! \n\n// new HW\n// create a recursive function binSearch(n\, low\, high) that looks for the number n in a sorted list\n\n// This is called the binary search algorithm\n\n// binSearch(5) = true\n// binSearch(1) = false\n// 0 2 3 4 5 6 7 8\n\n// see if n is equal to len(list) / 2\n// if it is greater than len(list) / 2: traverse the upper half\n// else traverse the lower half\n\n// base case\n// operation\n// recursive function\n\n// output: true or false\n\nhint: use low and high as variables to determine which part of the array to look around\nAlso watch these two videos: \nDynamic Programming: https://www.youtube.com/watch?v=oNoILrFOx2k \nGreedy Algorithms: https://www.youtube.com/watch?v=lfQvPHGtu6Q \n\nNotes:\nYou can reach out to me at ddjapri@ayclogic.com if you have any questions! \nYou can find class notes here.
URL:https://www.ayclogic.com/event/7-pm-intro-to-competitive-programming-darin-14/
CATEGORIES:Intro To Competitive,Java
END:VEVENT
END:VCALENDAR