Comments for Branch Conditionally

Comment on How Much Time Have You Spent Listening To Music? by Gvidales

Gvidales — Thu, 22 Oct 2009 07:07:33 +0000

I’ve been trying to do the same for a couple hours, by programming in c++ and importing the library as a text file, can you help me do it this way with mine? did you do an .exe?

Comment on Automated setup of Waterloo’s Coldfire boards by Derek Shaw

Derek Shaw — Fri, 26 Jun 2009 00:59:48 +0000

Fixed, thanks!

Comment on Automated setup of Waterloo’s Coldfire boards by Ryan Fox

Ryan Fox — Thu, 25 Jun 2009 20:35:36 +0000

Thanks for this. I tried doing a bash script myself, then found expect, but didn’t want to write this myself.

There’s a small typo in the expect script though:
send “tftp -f $argv.s19r”
should be:
send “tftp -f $argv.s19\r”

Comment on Reducing Stress by Increasing Stress by Michael

Michael — Tue, 24 Mar 2009 04:13:41 +0000

I totally know what you mean, every single time I’ve had to do that quiz, I’ve copied and pasted the answers into Notepad as well.

Comment on wikiRng Implementation by Branch Conditionally :: Threaded wikiRng

Branch Conditionally :: Threaded wikiRng — Sat, 02 Aug 2008 00:17:19 +0000

[...] said “write some threaded Java code,” listening, I decided to take another look at my wikiRng program. The idea was simple, use multiple threads to crawl Wikipedia [...]

Comment on Finally, a case for finally by Branch Conditionally :: Finally, Finally analyzed

Branch Conditionally :: Finally, Finally analyzed — Fri, 28 Mar 2008 19:32:14 +0000

[...] in “Finally, a case for finally” I described a method for using the try…finally block for creating a simple counting [...]

Comment on Finite Markov Models by Branch Conditionally :: Solving Finite Markov Models with the Z-Transform

Branch Conditionally :: Solving Finite Markov Models with the Z-Transform — Sat, 22 Mar 2008 22:53:50 +0000

[...] like before, we know that the sum of states is [...]

Comment on Saving Private Private by Andrew Chung

Andrew Chung — Fri, 26 Oct 2007 21:08:09 +0000

You should also look at the Singleton design pattern; it only allows for a single instance of a class to be instantiated. This is done by making the constructor private, and instantiation is controlled by something like a getInstance() method which will call the construtor if no instances exist, otherwise, return an instance of the class.

Comment on Finding The Maximum Sum of a Run by admin

admin — Sat, 18 Aug 2007 19:07:34 +0000

Damn it, you’re right. I guess I was completely off my rocker. Thanks for catching it.

-Derek

Comment on Finding The Maximum Sum of a Run by Andrew Chung

Andrew Chung — Sat, 18 Aug 2007 10:48:55 +0000

Is step 2 even correct? n “substrings” will result in O(n^2) nodes, and summing over each branch in the suffix trie should be O(n^2) time, would it not?

Another thing, the maximum value subsequence need not be a suffix, it can be in the middle of the array (ex. 10 element array, max sum is entries 5-7, so it can be the elements 1-3 of the suffix starting at 5), and determining the solution to this is pretty much the same as the original problem.