Recursion

This week in programming we have learnt about Binary Search Trees (BST). While creating the program for a BST recursion is a great method to know and to use. Recursion is when a method calls itself from inside. You can read more about it on wikipedias page about recursion: http://en.wikipedia.org/wiki/Recursion_%28computer_science%29
I thought I could go through how I wrote my code to find the node to erase in the tree and why I chose to do it in that way. […]

Recursion

This week in programming we have learnt about Binary Search Trees (BST). While creating the program for a BST recursion is a great method to know and to use. Recursion is when a method calls itself from inside. You can read more about it on wikipedias page about recursion: http://en.wikipedia.org/wiki/Recursion_%28computer_science%29
I thought I could go through how I wrote my code to find the node to erase in the tree and why I chose to do it in that way. […]

Data structures

What did I do?
I wrote algorithms for two basic generic data structures: a linked list and a binary search tree (BST). This was done for two reasons: to derust after not coding for a while, and to learn a bit about data structures.
Some short definitions: a linked list consists of nodes, which contain some data and a pointer to the next node in line. This creates a list which can be easily iterated through in order to find whatever data […]

Data structures

What did I do?
I wrote algorithms for two basic generic data structures: a linked list and a binary search tree (BST). This was done for two reasons: to derust after not coding for a while, and to learn a bit about data structures.
Some short definitions: a linked list consists of nodes, which contain some data and a pointer to the next node in line. This creates a list which can be easily iterated through in order to find whatever data […]

Totemic at DreamHack Winter

In two weeks time we will be taking Totemic to DreamHack Winter, we will be at Uppsala University’s booth at the DreamExpo.
Come see us there and play Totemic!

Programming III – First Weekly Post

During out first lecture this semester we were tasked to compress a specific .bmp-file to as small of a size we could. I worked with Jonas Lundgren and William Nordin with this and we managed to take take it down from 190kb-something to 20-25-something if I remember correctly, but we never managed to decompress it again die to time constraints.
I just started with one of our assignments for this course as well. In this assignment we are going to write […]

Programming III – First Weekly Post

During out first lecture this semester we were tasked to compress a specific .bmp-file to as small of a size we could. I worked with Jonas Lundgren and William Nordin with this and we managed to take take it down from 190kb-something to 20-25-something if I remember correctly, but we never managed to decompress it again die to time constraints.
I just started with one of our assignments for this course as well. In this assignment we are going to write […]

First week programming III

On the first day of the course we were faced with a challenge; compress and decompress an image file. This were to be programmed work with other images as well so nothing could be hard coded.
There are different approaches to this task such as checking the bitmap for color patterns but after the task we also learned about the method of calculating the colors as geometrical figures.
The team consisting myself, David Peldan and Oliver Bolt began on the the first […]

First week programming III

On the first day of the course we were faced with a challenge; compress and decompress an image file. This were to be programmed work with other images as well so nothing could be hard coded.
There are different approaches to this task such as checking the bitmap for color patterns but after the task we also learned about the method of calculating the colors as geometrical figures.
The team consisting myself, David Peldan and Oliver Bolt began on the the first […]

Game Programming III – First Week

In the Game Programming III course we will learn multithreading, 3D engines and networking.
We started this week with Compression Challenge. The challenge was to write a program that compresses a bitmap picture to the smallest possible size and then decompresses it back to it’s original state. I failed to complete my solution for this, but I did read some about Huffman coding and run-length encoding.
Then, some syntax was presented to the class. We were shown how to use templates, which allows a function and/or class […]

Back to programming!

Finally we started programming again and moved on from all that nonsense of playing board games and whatnot. Part of this course we need to write weekly blogs so I will be more active again.

So in this course we have 3 assignments.

Assignment 1 – Create a linked list and a Binary search tree. (Almost done with this)
Assignment 2 – Consists of writing a webserver
Assignment 3 – Create our own 3D game and engine using DirectX.

So this week I will share my […]

Starting a new programming course!

So I have started this new course called Gameprogramming III. It feels good to start coding after a few months of game design.
We started of the week by creating a BMP compressor in C++ just to get into programming again. We had to compress a bitmap image file to the smallest possible size. I got down to ~10 KB. It was really fun to work with that. I got to work on the binary level which is pretty new for […]