Lab46 Wiki

Brief overview of today's class:

• talked about arrays and linked lists, singly, doubly, etc.
• each item in a list is considered a node
• a singly linked list goes in one direction and loops back after the entire list has been run through
• the doubly linked list has two pointers that connect two nodes together

Build List for project:

• display
• insert
• append
• obtain
• clear
• quit

This week we are wrapping up SLL2. This project brought about some new things that we had not used currently. One of these things would be a double pointer in the obtain.c file. While seemingly daunting at first, the double pointer basically means that the node pointer (thatNode) is pointing to another node (tmp). This is done so that we can declare a variable for the node that we want to obtain, and then grab it with the use of thatNode.

This past week was rather exciting in HPC. I had the opportunity to play around with a bare-bones touch panel and OpenBSD. The side project came about when we were discussing the idea of creating an interactive thing of sorts for students to toy with outside of in the hall. We discussed having the video wall placed outside with a touch panel on each monitor and doing some sort of a huge game of tic tac toe or something. The only issue with that at the moment right now is that we don't currently have the video wall at our disposal, (its in the old lair) and we also don't have 8 more 15“ touch panels to configure. So for now, we were able to configure just one as a proof of concept model. I'm now working on a simple html program to implement a tic tac toe game. Things are coming along, but I'm quickly realizing that an html and java mix aren't the best option when it comes to making games. However, I'm invested, so lets see where this goes.

Woo! First week of November complete! This week, we discussed the tic tac toe game in datacomm. However, as opposed to making the bare bones program, we instead attempted to figure out the math behind tic tac toe. By doing this, we essentially are trying to “solve” tic tac toe for each possible win. In simpler terms, we are trying to get a single standalone equation that, when executed, all the possible win combinations will come out. It is rather fascinating. The grid of the game is a 3×3, looking like this if you were to number each cell:

0 1 2

3 4 5

6 7 8

It can be seen right away that there are patterns with each possible win. Going horizontally, each row goes up by 1. Vertically, each row goes up by 3. Left diagonal is by 4, while the right diagonal goes up by 2. We haven't solved the equation yet, but we got pretty darn close as of late.

This week we concluded the projects of DLL0 and DLL1. The projects were tough, and even though I didn't get all of it, I think my understanding is still improving more and more by the day. My 5+ hour sessions in the lair are mentally taxing sometimes, but I am getting things done and progressing in my understanding of data structures as a whole. In HPC, I am still working with the touchscreen, but I am attempting to implement it with other systems, such as Kodi (XBMC) that is running on a android base. Kyle also got it running with ubuntu in order to play his tic tac toe game he made in java. Which is pretty kickass, I must say. Tyler's iteration of the game in c is pretty awesome as well. Seeing a graphical application in the terminal is quite impressive. Makes my html/java application look rather lame… However, it's a work in progress. Hopefully we will be able to get the touchscreen out in the hall sooner than later.