Have you ever wonder how bit masking work (or what is that?) and why do you need it? Or why a tree structure exists? (or what is breadth first vs depth first), or what are game trees? We put our Computer Science hat and go “depth first” in some fundamental compsci concepts, and, more importantly their utility, ending with Game trees (and they are not only used for games)!

Follow Me on Twitter! (@fguime)(thanks!)

Hey it’s SPRING! and I would love to get a beer 🙂 Tweet, Tweet! (https://twitter.com/#!/fguime)

• Steve Yegge Blog (Get that job at Google!)
• Jeff Atwood Blog(Why Can’t Programmers.. Program?)
• Bitwise Operations in Java
• Binary Trees
• Tree Parsing and Evaluation example
• Game Trees

Vote for us in iTunes (http://itunes.apple.com/us/podcast/java-pub-house/id467641329) Questions, feedback or comments! comments@javapubhouse.com Subscribe to our podcast! (http://javapubhouse.libsyn.com/rss) ITunes link (http://itunes.apple.com/us/podcast/java-pub-house/id467641329) Java 7 Recipes book! (http://www.amazon.com/gp/product/1430240563/ref=as_li_ss_il?ie=UTF8&tag=meq-20&linkCode=as2&camp=1789&creative=390957&creativeASIN=1430240563) Hey! if you like what you hear, treat me a beer! (It’s the Java pub house after all 🙂 https://www.paypal.com/cgi-bin/webscr?cmd=_s-xclick&hosted_button_id=Z8V2ZWV93UMW4