@BlockClubCHI@ChicagosMayor said we need counselors, and nurses in our schools, but students hardly even use those services to be honest. They need better teachers, better school lunches, more work opportunities. @CTULocal1 is a political organization more than a teacher/student org
Remember a few years ago when @CTULocal1 members protested by walking out of classrooms, refusing to teach and closing schools in order to get a contract aggreement? Years later, they are doing it again, nothing has changed. The money didn't change anything! @usedgov@JBPritzker
@Andrefor40th why didn't you sign this @jessiefor26th? You went to Schurz and should know more than anyone on this list how messed up this whole situation for low income kids
I like using the master thereom over recursion trees and unrolling to find the time complexity of an algorithm, but it doesn't work for all cases. It only works for some constants a > 0, b > 1, and d >= 0 in T(n) = aT([n/b]) +0(n^d).
aT = # of recursions
n/b = size of problem
My professor picks one person to share a joke at the beginning of class every day.
I shared mine this week.
"Why do programmers prefer dark mode?"
....
Because light attracks bugs
*mic drop* 🎤😄
I joined the 1st cohort for ThinkChicago Skill Builders, which means I have access to CodingTemple's Cybersecurity Track for the next few months. I'll be posting more on ethical hacking x cryptography.
Also, in honor of Oppenheimer appearing on Peacock soon, I learned one of the scientists who worked on the atomic bomb created and used the Monte Carlo algorithm for the bomb, which is often used to simulate the probability of different outcomes in poker and gambling today.
How do you show if a proposition has logical equivalence? How do you negate a proposition? Learning how to prove predicate logic using quantifiers for Algorithms II