December 11th, 2015
Classwork/Homework:
Finish up the Philadelphia Classic Problems
Read 6.4, 6.6 and 6.7 sections.
PClassics: Challenging CS competition: Philadelphia Classic
Philadelphia Classic Spring 2016 Contest
Start from problems 4 on in class and for homework.
Work with a partner. DO NOT LOOK FOR THE SOLUTIONS
Pay special attention to the following:
1. Make sure you read the instructions in the first 2 pages.
2. Read the problem many times before you get started.
3. Draft a plan on paper or a document before you start.
4. Test parts of the code before you develop the “whole” program.
5. Do not use outside help of any sort.
6. All students have to turn in the assignments to edmodo.com
Fun with Lego Mindstorms
This genius machine can fold and fly paper airplanes… using only LEGOs.
Posted by The Verge on Monday, February 8, 2016
Midterm Review ArrayLists – sorts – inheritance
AP Computer Science 2013-2014
Midterm date: 1/28
Midterm review Two-review days
Look at self-review, short answers, true/false and multiple choices exercises for chapters 2 through 8.
Review the following concepts:
Recursion: easy algorithms like factorial, Fibonacci, mathematical expression, palindrome, reversing order of a string.
Searches and Sorts: non-recursive and recursive
Arrays and ArrayLists:
• ArrayLists methods
• Iteration of an ArrayList
• Generic Classes
String class and methods
Inheritance: “ is a ” concept
• Look at the Pet application on pages 401 and on.
• Inherited methods – super
• Overloading and overriding
• Shadowing
• Abstract classes
•
Interfaces specially Comparable
Know how to compare elements in a linked structure, arrays, arrayLists and inherited objects.
Princeton Splash
PROMYS
PROMYS provides a lively mathematical environment in which ambitious high school students explore the creative world of mathematics. Through their intensive efforts to solve a large assortment of unusually challenging problems in Number Theory, the participants practice the art of mathematical discovery – numerical exploration, formulation and critique of conjectures, and techniques of proof and generalization. More experienced participants may also study The Mathematics of Computer Graphics, Complex Analysis in Number Theory (Dirichlet’s theorem on arithmetic progressions), and Geometry and Symmetry. Problem sets are accompanied by daily lectures given by research mathematicians. In addition, a highly competent staff of 20 undergraduate counselors live in the residence halls and are always available to discuss mathematics with students. Advanced participants also develop independent research projects advised by research mathematicians. Special lectures by outside speakers offer a broad view of mathematics and its role in the sciences and in future career options.
Algorithmic Thinking Summer Program
If you are interested in an intense summer program on computer science algorithms, Professor Gandhi started accepting applications for the 2017 Summer Program in Algorithmic and Combinatorial Thinking – PACT. More information on registration can be found here:
Blueprint – Hackathon
The Hour of Code
Next week we are having THE HOUR OF CODE!
Bring a friend to class. The date will be announced soon.
We are on the map!!!
HackRPI
