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 a generic Linked List and a generic Binary Search Tree. I have finished the Linked List and begun working on the Binary Search Tree a little bit now.

When the assignments were first uploaded a week or two ago I decided to look up a tutorial (which I unfortunately haven’t been able to find again) on Linked lists and Binary Search Trees, so I had at least some understanding of how a Linked List works and how to write one. So a couple a days ago I started to write my own Linked List. At first it seemed way more complicated than it actually was, and after a while when I got used to working with the everything became much easier. I started with making a Linked list just for int’s and then I used templates to make it generic after I got it to work I don’t believe that my Linked List is that efficient, but it’s working and that is enough for now, I will most likely go through it again later, but I will now focus on the Binary List instead which seems like a fun challenge.

Filed under: Uncategorized Tagged: 5SD048, Campus Gotland, game, III, programming, Uppsala University