http://www.kyle-brady.com coherent thoughts on diverse topics Fri, 20 Nov 2009 12:10:48 +0000 http://wordpress.org/?v=2.8.6 en hourly 1 http://www.kyle-brady.com/2009/07/23/cis37a-at-mission-college/ http://www.kyle-brady.com/2009/07/23/cis37a-at-mission-college/#comments Thu, 23 Jul 2009 07:30:33 +0000 Kyle Brady http://www.kyle-brady.com/?p=3434
The code is all pretty hacky, ugly, and "it works for their problem statement, move on" style, but it's been posted anyways.

Check out the missionProjects/cis37A repository.]]> http://www.kyle-brady.com/2009/07/23/cis37a-at-mission-college/feed/ 0 http://www.kyle-brady.com/2009/05/26/inlineassembly-in-c/ http://www.kyle-brady.com/2009/05/26/inlineassembly-in-c/#comments Tue, 26 May 2009 16:40:01 +0000 Kyle Brady http://www.kyle-brady.com/?p=2631
Essentially, we had to convert some C functions into their inline assembly counterparts.  See the PDF file for details.

All code is available via SVN, and a web-browsing utility.

Note:  I am not advocating using this code in place of doing your own homework, or in any situation other than pure interest.  However, in the event that you do, I am not responsible for any resultant issues (legal, moral, or ethical) that may arise.  Finally, I am not presenting these as perfect cases, the best way to approach the problems, nor the fastest.  They are, simply, viable solutions.]]> http://www.kyle-brady.com/2009/05/26/inlineassembly-in-c/feed/ 0 http://www.kyle-brady.com/2009/04/29/needlemanwunsch-using-the-n-w-algorithm-in-java/ http://www.kyle-brady.com/2009/04/29/needlemanwunsch-using-the-n-w-algorithm-in-java/#comments Wed, 29 Apr 2009 07:15:55 +0000 Kyle Brady http://www.kyle-brady.com/?p=2002 Needleman-Wunsch algorithm, a dynamic programming method.  Examples are given for usage below.

It was due at midnight tonight, and I was done earlier, so this is a scheduled post.

All code is now available via SVN, and a web browsing utility.

Note:  I am not advocating using this code in place of doing your own homework, or in any situation other than pure interest.  However, in the event that you do, I am not responsible for any resultant issues (legal, moral, or ethical) that may arise.  Finally, I am not presenting these as perfect cases, the best way to approach the problems, nor the fastest.  They are, simply, viable solutions.]]> http://www.kyle-brady.com/2009/04/29/needlemanwunsch-using-the-n-w-algorithm-in-java/feed/ 0 http://www.kyle-brady.com/2009/04/29/unrealtournament-basic-functionality-java-vs-jasmin/ http://www.kyle-brady.com/2009/04/29/unrealtournament-basic-functionality-java-vs-jasmin/#comments Wed, 29 Apr 2009 07:15:19 +0000 Kyle Brady http://www.kyle-brady.com/?p=2010 Dr. Pearce), and translate it into modular Jasmin code.  The project structure uses inheritance, among other common Java "tricks", all of which had to be implemented in the Jasmin.  The project's scope, so to speak, was to mimic the basic functionality of Unreal Tournament, if only in our minds.

I think our Professor is a gamer.

It was due at midnight tonight, and I was done earlier, so this is a scheduled post.

All code is now available via SVN, and a web browsing utility.

Note:  I am not advocating using this code in place of doing your own homework, or in any situation other than pure interest.  However, in the event that you do, I am not responsible for any resultant issues (legal, moral, or ethical) that may arise.  Finally, I am not presenting these as perfect cases, the best way to approach the problems, nor the fastest.  They are, simply, viable solutions.]]> http://www.kyle-brady.com/2009/04/29/unrealtournament-basic-functionality-java-vs-jasmin/feed/ 0 http://www.kyle-brady.com/2009/04/22/hackersplan-finding-all-vertices-shortest-paths-in-java/ http://www.kyle-brady.com/2009/04/22/hackersplan-finding-all-vertices-shortest-paths-in-java/#comments Wed, 22 Apr 2009 07:15:54 +0000 Kyle Brady http://www.kyle-brady.com/?p=1927 Floyd-Warshall.  It accepts the graph as String array, using "1" for an element that can be connected-to, and "0" for otherwise.  Full details in the "Project Details" file, and easily-usable examples in the Constructor.

It was due at midnight tonight, and I was done earlier, so this is a scheduled post.

All code is now available via SVN, and a web browsing utility.

Note:  I am not advocating using this code in place of doing your own homework, or in any situation other than pure interest.  However, in the event that you do, I am not responsible for any resultant issues (legal, moral, or ethical) that may arise.  Finally, I am not presenting these as perfect cases, the best way to approach the problems, nor the fastest.  They are, simply, viable solutions.]]> http://www.kyle-brady.com/2009/04/22/hackersplan-finding-all-vertices-shortest-paths-in-java/feed/ 0 http://www.kyle-brady.com/2009/04/15/advanced-sequence-control-jasmin-vs-java/ http://www.kyle-brady.com/2009/04/15/advanced-sequence-control-jasmin-vs-java/#comments Wed, 15 Apr 2009 07:15:51 +0000 Kyle Brady http://www.kyle-brady.com/?p=1812 Jasmin (Java's assembly language), involving basic command-line UI, recursion, if-blocks, loops, and more.

Also note that MathCUI requires MathUtils to work.

It was due at midnight tonight, and I was done earlier, so this is a scheduled post.

All code is now available via SVN, and a web browsing utility.

Note:  I am not advocating using this code in place of doing your own homework, or in any situation other than pure interest.  However, in the event that you do, I am not responsible for any resultant issues (legal, moral, or ethical) that may arise.  Finally, I am not presenting these as perfect cases, the best way to approach the problems, nor the fastest.  They are, simply, viable solutions.]]> http://www.kyle-brady.com/2009/04/15/advanced-sequence-control-jasmin-vs-java/feed/ 0 http://www.kyle-brady.com/2009/04/14/mazepath-in-java/ http://www.kyle-brady.com/2009/04/14/mazepath-in-java/#comments Tue, 14 Apr 2009 07:10:41 +0000 Kyle Brady http://www.kyle-brady.com/?p=1849 ConnectedComponents and KnightJumps, except that the goal is to find the shortest path between a start and end point, according to directional preference (North-East is preferred over South-East, for example) and move weights (diagonals = sqrt(2), not 1).  There are walls, and you're allowed to move diagonally.  Example mazes can be found in the ProjectDescription, with solutions.

This uses Dijkstra's Algorithm to find the shortest path in reverse:  dijkstra() and checkNeighbors().  After this is completed, the path is traveled forwards in order to mark it:  findPath() and compareNeighbors().  However, this code only works on examples up to somewhere near 70x70 input mazes, as the findPath() was written using recursion and it runs out of memory past a certain point.  A more correct version would be to use a looping mechanism to handle large examples.

Finally, I used the Java PriorityQueue, and not myPriorityQueue.java that is mentioned, even though it's included with the source below for reference.

It was due at midnight tonight, and I was done earlier, so this is a scheduled post.

All code is now available via SVN, and a web browsing utility.

Note:  I am not advocating using this code in place of doing your own homework, or in any situation other than pure interest.  However, in the event that you do, I am not responsible for any resultant issues (legal, moral, or ethical) that may arise.  Finally, I am not presenting these as perfect cases, the best way to approach the problems, nor the fastest.  They are, simply, viable solutions.]]> http://www.kyle-brady.com/2009/04/14/mazepath-in-java/feed/ 1 http://www.kyle-brady.com/2009/04/07/connectedcomponents-flood-filling-2d-maps-in-java/ http://www.kyle-brady.com/2009/04/07/connectedcomponents-flood-filling-2d-maps-in-java/#comments Tue, 07 Apr 2009 07:40:43 +0000 Kyle Brady http://www.kyle-brady.com/?p=1739
There's a built-in method called "testComponents" that gives examples of inputs and expected outputs, to help clarify the problem/solution set.

It was due at midnight tonight, and I was done earlier, so this is a scheduled post.

All code is now available via SVN, and a web browsing utility.

Note:  I am not advocating using this code in place of doing your own homework, or in any situation other than pure interest.  However, in the event that you do, I am not responsible for any resultant issues (legal, moral, or ethical) that may arise.  Finally, I am not presenting these as perfect cases, the best way to approach the problems, nor the fastest.  They are, simply, viable solutions.]]> http://www.kyle-brady.com/2009/04/07/connectedcomponents-flood-filling-2d-maps-in-java/feed/ 0 http://www.kyle-brady.com/2009/03/24/knightjumps-using-chess-rules-in-java/ http://www.kyle-brady.com/2009/03/24/knightjumps-using-chess-rules-in-java/#comments Tue, 24 Mar 2009 07:30:12 +0000 Kyle Brady http://www.kyle-brady.com/?p=1684
See the examples and description for details on board inputs and return values.

It was due at midnight tonight, and I was done earlier, so this is a scheduled post.

All code is now available via SVN, and a web browsing utility.

Note:  I am not advocating using this code in place of doing your own homework, or in any situation other than pure interest.  However, in the event that you do, I am not responsible for any resultant issues (legal, moral, or ethical) that may arise.  Finally, I am not presenting these as perfect cases, the best way to approach the problems, nor the fastest.  They are, simply, viable solutions.]]> http://www.kyle-brady.com/2009/03/24/knightjumps-using-chess-rules-in-java/feed/ 2 http://www.kyle-brady.com/2009/03/16/mergesort-and-quicksort-implemented-using-java/ http://www.kyle-brady.com/2009/03/16/mergesort-and-quicksort-implemented-using-java/#comments Mon, 16 Mar 2009 07:30:23 +0000 Kyle Brady http://www.kyle-brady.com/?p=1634
The real difference is that this uses Comparator data types instead of being type-dependent, meaning it can sort everything but an int.

It was due at midnight tonight, and I was done earlier, so this is a scheduled post.

All code is now available via SVN, and a web browsing utility.

Note:  I am not advocating using this code in place of doing your own homework, or in any situation other than pure interest.  However, in the event that you do, I am not responsible for any resultant issues (legal, moral, or ethical) that may arise.  Finally, I am not presenting these as perfect cases, the best way to approach the problems, nor the fastest.  They are, simply, viable solutions.]]> http://www.kyle-brady.com/2009/03/16/mergesort-and-quicksort-implemented-using-java/feed/ 0