<?xml version="1.0" encoding="UTF-8"?><!-- generator="WordPress/2.9.1" -->
<rss version="0.92">
<channel>
	<title>Chris Cowdery</title>
	<link>http://www.chriscowdery.com</link>
	<description>Coding, Design and all things Tech</description>
	<lastBuildDate>Sun, 27 Jun 2010 22:54:40 +0000</lastBuildDate>
	<docs>http://backend.userland.com/rss092</docs>
	<language>en</language>
	
	<item>
		<title>Fun with Computer Vision</title>
		<description><![CDATA[One of my early projects in Computer Vision was a simple Optical Character Recognition (OCR) program. Although this is by no means anything new, it&#8217;s still fun to learn how it works, and I&#8217;m going to share with you a little demo of OCR that you can create yourself!
Your mission, should you choose to accept it: Detect [...]]]></description>
		<link>http://www.chriscowdery.com/posts/179</link>
			</item>
	<item>
		<title>Seekqr</title>
		<description><![CDATA[Seekqr is a year-long project I started with Sean Madden, Sherman Lee and Brian Murphy for an entry into the Student Contest in Software Engineering (SCORE) 2011 competition (specifically the &#8220;QR Marks the Spot&#8221; project division). The project was initially started to showcase usability principles in cross-platform mobile application for the Engineering Methods of Software [...]]]></description>
		<link>http://www.chriscowdery.com/posts/173</link>
			</item>
	<item>
		<title>It&#8217;s About Time</title>
		<description><![CDATA[Hey! I&#8217;m not dead! In fact I&#8217;m very much alive, and I&#8217;m having a fantastic time down here in California at Apple.

I&#8217;ve been really busy getting into the swing of things, so I apologize for the dearth of updates. But! Without further ado&#8230; posts!
]]></description>
		<link>http://www.chriscowdery.com/posts/169</link>
			</item>
	<item>
		<title>Coding Kata – February 2nd 2010 – Bite Sized Katas</title>
		<description><![CDATA[In a slightly different vein, here are some smaller brainteasers for you to try!

Create an algorithm which divides any two numbers of different bases together. Does your algorithm work with negative numbers? How about negative bases?
How would you find a cycle in a linked list? Can you do it iteratively?
Multiply a number by 7 without [...]]]></description>
		<link>http://www.chriscowdery.com/posts/153</link>
			</item>
	<item>
		<title>Coding Kata &#8211; February 1st 2010 &#8211; Flippin&#8217; Lists</title>
		<description><![CDATA[Goal: Flip tuples in a doubly linked list.
Example: Given A  B  C  D, have an algorithm produce B  A  D  C.
Constraints: All manipulations must be made to the original linked list, and minimize use of external data structures as much as possible.
Hmmm of the day: The ideal solution is [...]]]></description>
		<link>http://www.chriscowdery.com/posts/151</link>
			</item>
	<item>
		<title>Coding Kata – January 29 2010 – Playing Vegas</title>
		<description><![CDATA[Goal: Design and implement an algorithm to detect certain hands in a game of Poker. You are given your parameters as 5 ints [0-13] representing each value of the card. The hands to check are:

Four of a kind (ex: 5,4,5,5,5)
Full house (ex: 5,4,4,5,5)
Three of a kind (ex: 5,4,5,5,1)
Two pair (ex: 8,4,4,5,5)
Pair (ex: 7,1,2,5,5)
High card (ex: [...]]]></description>
		<link>http://www.chriscowdery.com/posts/149</link>
			</item>
	<item>
		<title>Coding Kata – January 28 2010 &#8211; Crazy List Copying</title>
		<description><![CDATA[Goal: Create a duplicate copy of a linked list given the following facts about the linked list:

Each node in the list has a pointer to the next element in the list, or null if no element is present
Each node in the list has a data pointer which points to any arbitrary node in the list

Constraints:

You [...]]]></description>
		<link>http://www.chriscowdery.com/posts/135</link>
			</item>
	<item>
		<title>Coding Kata &#8211; January 27 2010 &#8211; The Ski Lift</title>
		<description><![CDATA[Goal: Create an algorithm to determine how close you are to the summit of a mountain (percentage) whilst on a chairlift. You know the following information:

What chair you are on
The chair coming in the opposite direction visible to your left at the current time

At what point do you have an accurate estimate of your progress? [...]]]></description>
		<link>http://www.chriscowdery.com/posts/133</link>
			</item>
	<item>
		<title>Coding Kata – January 26 2010</title>
		<description><![CDATA[Goal: Create code to rotate an N by N array 90 degrees clockwise.
Constraints: All manipulations must be made to the original array, but a single staging variable can be used.
Hmmm of the day: Can this be done for N by M arrays as well? If so, how? If not, why not?
]]></description>
		<link>http://www.chriscowdery.com/posts/131</link>
			</item>
	<item>
		<title>Coding Kata &#8211; January 25 2010</title>
		<description><![CDATA[Goal: Design a data structure and controller to model a Connect Four game.
Your controller must have two functions, putPiece and checkForWin (using any parameters you choose).
Constraints: Your checkForWin method should be relatively efficient (i.e. it can&#8217;t have O(n2) efficiency). Think you can do it in O(n)? How about O(1)?
Hmmm of the day: The most efficient [...]]]></description>
		<link>http://www.chriscowdery.com/posts/125</link>
			</item>
</channel>
</rss>
