brandonsilver.com

github.com

brandonsilver (Brandon Silver) · GitHub

https://github.com/brandonsilver

X62;randon@brandonsilver.com. Http:/ www.brandonsilver.com/. Feb 1, 2011. My treasure trove of configuration files. Learning and investigating Ruby on Rails. Another sample RoR project. 19 contributions in the last year. Summary of pull requests, issues opened, and commits. Learn how we count contributions. Brandonsilver has no activity during this period. You can't perform that action at this time. You signed in with another tab or window. Reload. To refresh your session. To refresh your session.

notes.brandonsilver.com

Brandon's Notes

http://notes.brandonsilver.com/2012/04/02/Shapes-Notes-And-More.html

Shapes Notes And More. Don't make your shapes class extend anything. Have an overall class called "Shape" with subclasses "oval" "polygon" "rectangle" etc. and have each subclass extend Shape. It would be nice to have a copy-paste function in the program. Maninpulator box" around each shape created by a method that overrides the "draw component" thingy. Binary Tree: Each node has 2 possible children, growing downwards. Binary Search Tree: If it's balanced, can be searched in logn time. quite fast.

notes.brandonsilver.com

Brandon's Notes

http://notes.brandonsilver.com/2012/03/07/Game-of-Life-Notes.html

Game Of Life Notes. Game of Life Due Next Wednesday. Lots of special cases. One option: 9 nested loops. Only 1 million things, ints will work. Better option: recursive calls. Based off of Conway's game of life. See the rules on the assingment page. You'll need two grids: the current generation and the next generation. The next gen will be computed off of the current gen. Arrays of buttons, etc. Necessary part of the program (the array wraps around). For A[0][0], to find the neighboors to the left.

notes.brandonsilver.com

Brandon's Notes

http://notes.brandonsilver.com/2012/04/11/Model-View-Controller-and-Trees.html

Model View Controller And Trees. Friday, April 13, 2012, 4:00PM at NRC 106. Apparently, we should have had this lecture BEFORE shapes1 was due.oh well. The model is the data we're going to use. In Shapes1, it's the ArrayList of our shapes. The View is the display of the model. In Shapes1, the View uses the components to help the shapes draw themselves. The Controller controls either the view or the model. It's nice to keep the Model, View, and Controller kind of seperate. An empty binary tree.

notes.brandonsilver.com

Brandon's Notes

http://notes.brandonsilver.com/2012/02/01/Object-Inheritance.html

Inheritance and Objects Continued. Inheritance and Objects Continued. Because an Undergraduate is always a student. Fine, ` Object Casting. Calling Super in a constructor. When you make an object, a constructor for its superclass is also called. You specify which constructor you want with the ` super" notation:. In Java, the class ` Object" is the descendant of ALL classes. Object Methods (that are important). ToString returns a printable thing of the object. Three Main Features of OOP.

notes.brandonsilver.com

Brandon's Notes

http://notes.brandonsilver.com/2012/01/30/Multi-Dimensional-Arrays.html

Instantiation: Int[][] table = new int[3][4]; / declares an array with 3 rows and 4 columns. Accessing Elements: table[row][column] = 23;. In java, multidimensional arrays are in fact arrays of arrays. Extracting a row of a table: int[][] table = new int[40][40]; int[] row1 = table[1];. Extracting a column is not so easy. Higher than 2 dimensions. Declares an array w/ 10,000 elements. Arrays with rows of different lengths. We're making connect 4 as a console program! A derived class inherits.

notes.brandonsilver.com

Brandon's Notes

http://notes.brandonsilver.com/2012/02/27/CS2-Midterm-Review.html

Due Friday of this week. Think about how things were structured in MineSweeper. Project Euler Examples / Notes. We start with a number too big to fit in an int, use a long instead. Just use the Sieve, and use longs because ints are too small. Need a routine that will give you for any number its factors. Probably within the long range. Remember that it's asking for 501 divisors. Since they're too big to fit in longs, you may have to write your own addition routine to add ascii. Things to know for Midterm.

notes.brandonsilver.com

Brandon's Notes

http://notes.brandonsilver.com/2012/04/04/Stacks-And-Queues.html

This will be important for the calculator assignment. Last-in, first-out (LIFO): the last item placed on the stack will be the first item removed. Analogy: a stack of dishes. You only interact with a stack through the last item on the stack; either add or remove from the top. Determine if stack is empty. Push" item on stack. Peek" - look at the item on top of the stack. Linked List as Stack. You add and remove things from the head. Array or ArrayList as a stack. Add to the end, and remove from the end.

notes.brandonsilver.com

Brandon's Notes

http://notes.brandonsilver.com/2012/04/16/Calculator-Notes-Etc.html

Brandon@brandon-macbook java calc Expression: 33 * (. Spacing is important, one per operand/operator. User types in infix program converts to postfix program evaluates postfix result printed. Shunting Yard Algorithm, etc. Might use an ArrayList instead of a Stack. Another site by brandon silver. Last updated on Tue May 01 23:55:32 -0500 2012.

notes.brandonsilver.com

Brandon's Notes

http://notes.brandonsilver.com/2012/02/06/ArrayList.html

An array of any object type that expands for you as needed. Primitive types are NOT allowed. Use angle brackets to indicate the type:. A parameter in the constructor indicates initial capacity:. What's so great about ArrayLists? You don't have to know size beforehand. Tedium and bugs of resizing an array yourself eliminated. Con:. Slower than an array. Type inference" allows us to eliminate one of the type specifiers:. Fun, CS1-level problems. I need to do more of these. Project Euler No. 15. Catch speci...