Graduation Coming!

Well Its been a long road, but my time at Devry is ending. Ill be graduation on December 17th 2010 with my Bachelors of Science and Game and Computer Simulation! However even though my time at school is over im still building up my knowledge in software engineering and game design. Companys usually want more than just college smarts as their requirements for postions so I have been working on stuff like ASP.NET, Android, PHP, XHTML, CSS, XML, and many other technical skills.

I think this is something that everyone should practice while they are in and out of school! Do your own research outside of homework, it really pays off! Also for anyone who is also doing the GSP program understand that it really tough to land a game industry job outside of college other than maybe interships. If you have the chance to intern do it! As for me im looking into software engineering postions, web programming positions using C#, ASP.NET etc, as well as internships.

Adjacency Matrix

Last lab was a little tough but with some pointers from the professor I finished it. I had to write a new member function "degree" for the Wtgraph C++ class given. The "degree" function should determine and output how many even degree vertices there are and how many odd degree vertices, and then calculate the weight of them all. The trouble I was having was that instead of my for loop adding up each row and doing the odd/even check it did the check for each vertex. All I had to do though was move the check outside of the for loop for "j" and add a row/column counter. Doh!

Discrete Mathmatics

-Ask the user for the required number of initial values.

-Determine the next 19 values according to the given recurrence relation.

-Output the resulting 19 values along with the values for the two representative functions provided

Recursive functions are useful when you cannot decide which route to take with a particular problem, you can save time by testing different results with recursive functions. Although they can be memory hogs becuase they call themselves until the problem is solved.

This took a lot of planning out on paper in order to visualize correctly on how the program would flow. What i had a real hard time grasping was how i would take the user input which was in an array, and plug it into my function that executed the recursive algorithm. From there i also had to print out the appropiate number to the screen, which was another toughy. I used a for loop and incremented the number n to 18. Each cycle would print out and execute the algorithms.

Comming along

Just finished Calculus, and now I am taking Discrete Mathmatics. Sounds like something you could get arrested for right? It actually a pretty cool class where you solve logic based math puzzles, and put them into C++ form. First ILab had me make a C++ console app that ran through a truth table. There were two problems that were kinda like this:


A says B is lying
B says A is telling the truth

User put in input whether or not A and Bare telling the truth using "T" or "F".

They way i checked for consistancy though could of been more effecient though:

//Checking for true and false values. Probably not the most efficient way
if (p == "T" && q == "T")
{
varA = "FALSE";
varB = "FALSE";
}
if (p == "T" && q == "F")
{
varA = "TRUE";
varB = "FALSE";
}
if (p == "F" && q == "T")
{
varA = "TRUE";
varB = "TRUE";
}
if (p == "F" && q == "F")
{
varA = "FALSE";
varB = "FALSE";
}

But it works!