Kyle Brady: Blog » Code

CIS37A at Mission College [Old Content]

Kyle Brady — Thu, 23 Jul 2009 07:30:33 +0000

During summer session, I completed a requirement at SJSU by taking CIS37A, an "Intro to C" class. Although the homeworks were admittedly done rather last-minute.

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.

asmParser – A Lesson In Research [Old Content]

Kyle Brady — Fri, 08 May 2009 01:42:00 +0000

In my CS47 class, we've just started working on using Inline Assembly (assembly code processing built into the gcc compiler), and I thought the way you do it is pretty ugly. The assembly, which is put inside a C file, looks like this:

asm("command1\t\n","command2\t\n","command3\t\n");

Keep in mind that's wrapped inside a C file. Assembly. In a C file.

Naturally, I thought there was probably a more clever way to do this - I knew that asm() wasn't a true function, that it was a compiler instruction, but I assumed that it would pretend to be like a function and accept a variable as an argument.

Nope.

But I didn't discover that I was wrong until I got weird errors while compiling:

gcc -S -masm=intel ./asmParser.c

-> error: argument of 'asm' is not a constant string

This is when I jumped onto #c on irc.freenode.net, and was essentially laughed at. I guess that's what I get for trying to be clever... too clever.

You can find the everything-works-but-the-asm()-part code here with the exampleCommands file, or download everything as a zip file.

Next time I'm going to do a little more research!

Advanced Sequence Control, Jasmin vs. Java [Old Content]

Kyle Brady — Wed, 15 Apr 2009 07:15:51 +0000

This is some basic code to show comparisons between Java and 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.

ConnectedComponents, Flood-Filling 2D Maps, in Java [Old Content]

Kyle Brady — Tue, 07 Apr 2009 07:40:43 +0000

This is a bit of code that accepts a grid/matrix of valid and invalid position points, and fills them with labels according to breadth-first search. Can't traverse "solid walls" or spaces that are blocked, but can move horizontally. This is the equivalent of flood-filling rudimentary 2D maps for something like videogames... think old-school Pokemon/top-down-style.

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.

KnightJumps, Using Chess Rules, In Java [Old Content]

Kyle Brady — Tue, 24 Mar 2009 07:30:12 +0000

This is a bit of code that takes a description of a chess board, with markings for Start, Finish, and Invalid places, and moves the piece following the rules of a Knight, until it reaches the Finish; returning the least number of steps to get there.

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.

MergeSort and QuickSort, Implemented Using Java [Old Content]

Kyle Brady — Mon, 16 Mar 2009 07:30:23 +0000

I realize that both MergeSort and QuickSort are available in Java natively, but, hey, this is homework.

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.

Google PageRank, A Simple Implementation, In Java [Old Content]

Kyle Brady — Sun, 08 Mar 2009 05:19:47 +0000

This project was due last week, and I had it working except for a minor bug, which is why it hasn't been posted until now. The final debugging of this annoying little issue is courtesy of Kristopher Windsor.

This is a simple implementation of the original Google PageRank algorithm, using integers in place of URLs, relying on the BigMatrix class (included inside the Google.java file) for data storage. There are enough comments that it should be self-explanatory.

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.

BigMatrix, The Data Storage of Google PageRank, in Java [Old Content]

Kyle Brady — Wed, 18 Feb 2009 09:00:40 +0000

This is Part 1 of a 2-part assignment: replicating the original Google PageRank engine in Java, based on their published doctoral work. This is, essentially, the matrix-based storage engine that they use/used: large matrices implemented using linked lists for rows, allowing significantly faster access to data.

It also includes a "multiply" method, as this is important in the PR algorithm, which accepts a vector (column matrix), with its size ("height") being the number of rows in the data matrix. It should be usable as a stand-alone class, provided you follow the parameters.

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.

Fixed-Size Array Circular Queue, In Java [Old Content]

Kyle Brady — Wed, 11 Feb 2009 07:05:55 +0000

I had another project due at Midnight tonight, implement a class called "FixedSizeQueue" that uses a fixed-size circular array for a queue. I believe I've flipped the normal usage of head and tail, but it works just the same anyways. It should also be usable as a stand-alone class, instantiated with either void or an integer as a parameter, depending on what outcome you want.

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.

A Micro-1 Processor Emulator, In Java [Old Content]

Kyle Brady — Tue, 10 Feb 2009 08:00:55 +0000

I had to write an emulator of a Micro-1 Processor, in Java, that uses registers and memory addresses to do all of the computing, in addition to accepting commands in hexadecimal "op-code" format.

There was no "robot-verified" submission system, so I can only assume it's correct based on the outputs I get from known data. Also, this assumes you use a package called "micro1processor".

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.