Author Archives: Stephen S

Final Exam Review

Posted on May 23, 2016 by Stephen S

1. Prove using induction: 1 + 3 + 5 +···+ (2n − 1) = n^2 2. Give a big-O estimate for the number of operations (where an operation is an addition or multiplication) used in this segment of an algorithm: … Continue reading →

Posted in Final Exam Review | 2 Comments

Introducing Stephen Sokolovsky

Posted on February 7, 2016 by Stephen S

My major is Computer Science. I chose this major because I was introduced to programming during my freshman year in high school and I found it interesting. After graduating, I hope to get a career in this field and be successful. … Continue reading →

Posted in Uncategorized | Leave a comment