Friday, 14 July 2023

Collation of livetime (liverc) results for a user

I race little toy cars for plastic trophies! 

In all, i've got 6 RC cars. Not just your average kmart, warehouse, wallmart put some AA batteries in and watch them crawl along at a top speed of "walking pace", no way.

My 1/10th on-road car will do at least 60km/h (38mph) down our back straight, and it's 1/8th big brother will do something like 80-85km/h (50mph-ish). Some of our club members have cars, on our 85m back straight, will top 109km/h... impressive right!

Our results are collected via a transponder system from mylaps, everytime our cars passes over a wire, the transponder communicates with the timing computer and it logs its lap. 
Now this is where my problem started.... 

The results were hard to read on the website. All the data was there but it was hard to compare your first qualifying round to the second and then to your finals, because they showed on different pages. Therefor you needed lots of tabs open if you didn't want to go back and forth.

Initially i started writing this in PHP, i have a server that is always on the internet, so i just lodged it as part of my site. Using a fetch routine, i would go and get the page that had results on it, and then parse the page, looking for the results, collate them and then just show all the results in one hit. It wasn't the most elegant thing, but it worked. 

As you can guess i ran into a few problems, but i got there in the end. 

With that done, my thought was that now every time someone wanted to use this, my server was the one fetching all the results, and that could be quite taxing on page responses. 

So idea 2 then came to mind, lets write this in Javascript! The server would serve up the site, and the javascript would essentially do all the heavy lifting locally, it would be more or less like the user was browsing the site as it was coming from their computer. 
Ran into lots of issues here, the big one was CORS or Cross-origin resource sharing. Basically i couldn't grab the site locally then serve it up to you. This is pretty much how scammers work lol. 

I had been talking to a friend at work randomly about being able to get data from pages that didn't have any sort of API. He had recently come across a project that turned any website into an API! In walks wrapAPI!

So this ended up being magic, wrote the whole thing out to be just fetch and parsing data. 

Work pivoted for me, and i started working with react, which mean't i needed a project to work on, so i thought i would further refine this tool to be written in react, javascript worked, but it was very cumbersome.

Anyhow - long story short, i got practice with react, racers at our local clubs now get to enjoy a tool that shows all their race data in one hit, not having to have multiple tabs open, everyone wins!

Check out my collation tool

Wednesday, 31 May 2023

Slow speed using Evoluent mouse with linux mint 21.1

Recently i installed a fresh copy of linux mint 21.1

I've got a nice new 4K monitor that someone donated to me, which then hooked up to another donated PC fitted with a Nvidia 1060 6GB GPU nicely. 

While that's not impressive, it is for me. I always get the hand-me-downs, which is why i like running linux so much as these machines are always fast, they just out perform windows even when being old. 

Anyhow, i also have a nice Evoluent Vertical 4 Mouse, This mouse is great if you have some OOS (occupational over use syndrome). Stemming from my Cad days this mouse really saved my wrist from horrible all day pains

So with my 4K monitor, i scaled the 4K image up 200%, so both monitors were approx the same resolution. However the mouse point was slow. 

Even with the speed sliders at full, it was a real slog to try and get the pointer from one screen to another.

I thought it was something to do with the scaling that i had done with the driver, but when i tried another mouse, i didn't see the same effect, therefor leading me to assume that it was something special with this mouse. 

I found a great post in the end about increasing the mouse sensitivity. trying this out proved to be the fix that i needed. 

To see the current settings, use:

xinput --list-props "HOLTEK Evoluent VerticalMouse 4" | grep -i 158

Then to try new settings use: 

xinput --set-prop 8 158 2.000000 0.000000 0.000000 0.000000 2.000000 0.000000 0.000000 0.000000 1.000000

According to the post, the values you want to be tweaking are the two "2.00000" from the above command. These are the X and Y axis respectively 

Once i found mine, as suggested, i popped this into my ~/.bashrc, so that everytime the computer reboots, it will set the values i want.

Now.. where is my coffee....

Monday, 4 May 2020

Functions in aliases for bash



Thought i'd share a little nugget.

So i do a few commands in linux that are repetitive in nature, so i often alias them out so i'm lazy and don't have to type as much.
For instance, one of my repetitive commands is `git grep`, which is a great tool for going through your git repo to search those reg expressions.
So in my ~/.bashrc, i have
alias ggrep="git grep"
Now, all i do is ggrep <my search>

Something i learn't today however, is passing an argument to an alias.
My work has a lot of test boxes scattered around connected to different gear, so i ssh a lot to these. since the are all nicely formatted to tb<something a rather>, i decided i would now like to replace ssh tb0933 with tb 0933.
To do this is easy enough, but unlike a standard bash shell, we can't pass in the variable and just access like $x. Instead what we have to do is to create a function, and then call it.
So in the very simple case of the above my command equates to
alias tb='function ssh_tb=() { ssh tb$@; }; ssh_tb'
So expanding on this, we define the function ssh_tb() which when called, will execute the command ssh tb$@, and then at the end of this, we call it.

Easy!

Thursday, 26 March 2020

Linux device trees



Such a great resource at https://source.android.com/devices/architecture/dto/syntax

Thursday, 18 July 2019

Key bindings in linux for spotify



Had issues with my keyboard and the play button not working with spotify... (this was my work one).

So if you're play button is not working with spotify, then try this guys suggestion, http://shkspr.mobi/blog/2011/12/linux-spotify-keybindings/


Sunday, 16 December 2018

Videos not playing in opera on linux


So, it's no secret i've loved opera since the day i first installed it, I think i joined the opera revolution around the 3.62 mark in 1999 apparently! (man i'm old). Anyhow - read up more about the opera history here https://en.wikipedia.org/wiki/History_of_the_Opera_web_browser

Since i'm this fancy new software developer type person,  i have it installed as my browser of choice at work, but we run linux here since the platforms we use are linux as well. I'm not complaining mind you, i like linux too!

But the support for playing videos is lacking :( (wuh waaahhh), I believe this is due to the license with Mpeg's and not being able to distribute the codec with the program.
From this post it appears that Opera doesn't have the rights to distribute the codec with the program. however! Google does (cos they probably have deeper pockets right?)

Anyhow - very easy to fix, we simply copy over the top of the libffmpeg.so that we have in our opera directory with one from the google chromium browser :)

sudo cp /usr/lib/chromium-browser/libffmpeg.so /usr/lib/x86_64-linux-gnu/opera/


Restart the browser and things should be all good again :)


Tuesday, 4 December 2018

Measuring function time in linux using C


Measuring Time 

So in my job recently i had to time how long it took for a module to be plugged in before that module became "ready" ... the answer was 46 seconds.. but some careful polling changes and a change how firmware was loaded mean't that got chopped in half almost to 26 seconds!

But that's not the point, the point was how did i do such timing.

The original way i found was to use to use clock(). Clock returns an approximation of the processor time used by the program.
Using the following code..

#include <time.h>
#include <stdio.h> 
int main() 
{ 
   clock_t start, stop, length; 
   start = clock(); 
   
   function_to_be_time(parameters); 
   
   stop = clock(); 

   length = (double) stop - start / CLOCKS_PER_SEC; 

   printf("Time for your function was %ld\n", length); 
   
   return; 
} 

Now, this works mind you! but there's a gotchya here, oh yes, you saw that coming didn't you.. go on - admit it..
I probably didn't read the manual (RTFM!) for clock properly.... because the times i was getting back for my function calling didn't make sense compared to time stamped outputs!?
Clock() is returning time used by the program... i know - that didn't make sense, but it does if you mention the word threading.
See i was in a multi-threaded enviroment. So while this was timing my function in this "program" (ie thread!) my "program" had been running differently (in time) from other functions (ie threads!) that made up the entired module "ready" process.

Take 2. 

So instead, i used clock_gettime() with CLOCK_MONOTONIC.
This gave me a much better accuracy across my module insertion process, and started giving me numbers that made sense with other time stamped debug statements.

So.. using the following code,
#include <time.h>
#include <stdio.h>

/* Convert the timespec struct into a seconds value
static double TimeToSeconds(struct timespec* ts)
{
   return (double)ts->tv_sec + (double)ts->tv_nsec / 1000000000.0;
}

int main()
{
    struct timespec start, stop;
    double time_spent = 0;
    clock_gettime(CLOCK_MONOTONIC, &start);

    <YOUR FUNCTION GOES HERE>

    clock_gettime(CLOCK_MONOTONIC, &stop);
    time_spent = TimeToSeconds(&stop) - TimeToSeconds(&start);
    
    printf("your function time was %ld\n", time_spent);

    return;
}

Hopefully that helps someone with timing issues in threads etc.. lemme know if it works for you :)

Lastly - so i don't forget (possibly)... time stamping..
I'm just gonna post the code

time_t rawtime;
struct tm * timeinfo;
time ( &rawtime );
timeinfo = localtime ( &rawtime );
printf("Time Stamp is [%d:%d:%d]\n", 
        timeinfo->tm_hour, timeinfo->tm_min, timeinfo->tm_sec);

All good fun :)



Graduated!.... now what.


So you've graduated.... now what.

So that time came and went where i finished up my degree and paraded in front of my family across the stage to shake the mans hand that had never met me and get that piece of paper that now says what i always wanted to say... I'm qualified

Qualified.. I find it strange term. Its a term that says to people you know what we want you to know. But when push comes to shove..... do you?
I think the answer to that is much like the exam post, you go to an interview, the interviewer asks you the questions that we all know the answers too. So i guess... Rope interviewing? hah...

So now i've been released into the real world, to find my place, to make my 'mark' as the educators have instructed us. We have given you all the tools... we have given you the best possible start.
Sometimes it feels like i got shown to the boat, given some wood, nails, hammer and saw, and pushed off while waving goodbye i look down to find all the holes in the bottom now appearing.



Monday, 3 October 2016

Group Assignments, bad learning.



So... taking this great course (INFO263) and we are going learn up to 5 different coding languages... Just a pity that we never really get taught them.

The assignment for this course is worth like 40%, (Woah!), and it's a group assignment (Groan).

I've always thought that group assignments would be great, Really - i did... past tense..
I thought that it was a bit conveyance of what (the uni calls) the real world is all about, after all it's not like we get stuck in the corner at work and told you have 2 hours to complete this task in silence.
No - we work in teams, in groups, in lots of things like that.

However - what the real world has and our "group projects" don't have is a manager.. a boss... el captaino... big honcho .. etc etc...
This makes the real world work better, as when your fellow group member maybe not putting as much effort into the assignment as they oughta be, then in the real world.. the boss gets angry.. then turns green and smashes up the place.
Oh - wait, thats' a different boss...

Anyways - that is my point of difference is, as grumpy as you can get with different members of your group - that's all it is. Grumpiness, they don't care, all of a sudden they get a passing mark for their assignment and they've done diddly squat .. in kiwi speak - that's nothing. literally.

So anyhow - back to the topic. 5 coding languages, HTML, CSS, PHP, MYSQL, Javascript. The lecturer seems to be in his own little world with this tho, because its an INFO course, Majority of students taking it are commerce. Meaning ... it's all about the money money money (admit it - you sang that in your head didn't you).

So when he's showing us javascript on the power point, and saying (and i quote).. "I don't know why you would need all this math stuff on a business website"... its because not everything in this world is related to commerce.. thats why.
There are other reasons why you can use php other than to build a bloody shopping cart.

Anyhow - learn't more in two days of Code Academy (seriously good) than in 5 weeks of lectures, and then to top it off - the exam was all about design or proposing a solution to a website... none of which was done in class.... gah - the horror... the shame..

Anyhow - gotta run to the next class.... later gators!


Monday, 6 June 2016

Exam rants

Exams... what are they good for... really?

I realize that the academic world uses the exam process as a measure for how much information was squeezed into your brain in the last X period of time.

So they sit you down, give you a piece of paper that you quietly download your cranium onto in the hopes that in brief period of time that you are given a grade that means you know or you don't.

The problem is that.

Lets say you're like me, that sometimes a subject is interesting and that you find it invigorating to learn about it, and hence your grey matter soaks it up like a sponge to a puddle of water.
But - the person next to me finds it totally the opposite, dreary and mind numbingly aweful, and hence their brain refuses.. no matter how much they try.. to accept that this is going to be useful, and therefor prehaps you should learn it.
So - exam comes.. me.. i do really well, thats great.. person next to me does... ok - still manages to pass.

10 years pass by... (watch the tumble weeds go by)...
We both go for the same job, ohh look says mr employer... i see that you sat a course on molecular biophysics, just what we need, can you comment on ....
And here is my problem, i haven't used molecular biophysics in 10 years, i've been a truck driver... but yet - it says on my paper.. i sat an exam - and i got an X for it. At this point, i feel my knowledge is about the same as that person who was next to me....

I know - the argument here is that i was going for a job that needed that.. blah blah blah, but that aside, you see my point.

I bet for most of us, 6 months down the track - the information retained in the membrane isn't at the same level that it was during the 3 hrs that you were hurriedly scratching at a piece of paper for.

So while i can see that an exam is a measure of performance, it just sucks... esp when we get to the real world, and work in fricken TEAMS!

oh well...

Thursday, 2 June 2016

My fav little algorithm

So, just doing a bit more study and i thought i would share my favourite Algorithm so far, count sort.

I like count sort cos it's so easy and it just does it.
Count sort is non-comparison (which means it doesn't compare this number vs this number), and it's stable. This means that things are left in the order in which the appeared in the original list.

So here is how it all goes down, lets work on a list that looks like ..... alist = [2,5,3,0,2,3,0,3]

It has two stages:
Stage 1: Finding the key positions, count the appearance of that number in the list
Stage 2: Using key positions, we place the elements from the input array in the right order in the output array

To find the key positions in our list:
Find the maximum number in our list, in our example this would be.. 5
Now create a list the of [max_num+1] and fill it with zero's... so, in our case that would look like:
index   0, 1, 2, 3, 4, 5, 6
alist = [2, 5 , 3, 0, 2, 3, 0, 3]
kp=    [0, 0, 0, 0, 0, 0, 0] 

So we go thru the list and when we hit a number eg 5 we increment that index value by 1 ie...
index   0, 1, 2, 3, 4, 5, 6, 7
alist = [2, 5 , 3, 0, 2, 3, 0, 3]
kp =    [0, 0, 0, 0, 0, 1, 0] 

So when we have done that, the final array should look like
index   0, 1, 2, 3, 4, 5, 6, 7
alist = [2, 5 , 3, 0, 2, 3, 0, 3]
kp =    [2, 0, 2, 3, 0, 1, 0]

Now we have how often the numbers repeat, we need to use a running sum to organize the array to give us the true key positions we do this by... initializing our sum = 0 and our index = 0
a new c array to keep track of our sums (see what happens with that in a minute)
index    0, 1, 2, 3, 4, 5, 6
kp        [2, 0, 2, 3, 0, 1, 0]
sum = 0
index = 0
idxValue = 2

Put our sum in the array at position index position, each step here we will be incrementing index by 1
how it goes, is we get the value @ index i, switch that value for our current sum, then add the switched value to our sum value. I have tried to show this in one line, reading from left to right
index = 0  idxValue = 2 (kp[index] = 2) sum = 0 kp = [0, 0, 2, 3, 0, 1, 0]  new sum = 0+2
index = 1  idxValue = 0 (kp[index] = 0) sum = 2 kp = [0, 2, 2, 3, 0, 1, 0]  new sum = 2+0
index = 2  idxValue = 2 (kp[index] = 2) sum = 2 kp = [0, 2, 2, 3, 0, 1, 0]  new sum = 2+2
index = 3  idxValue = 3 (kp[index] = 3) sum = 4 kp = [0, 2, 2, 4, 0, 1, 0]  new sum = 4+3
index = 4  idxValue = 0 (kp[index] = 0) sum = 7 kp = [0, 2, 2, 4, 0, 1, 0]  new sum = 7+0
index = 5  idxValue = 1 (kp[index] = 1) sum = 7 kp = [2, 0, 2, 4, 7, 7, 0]  new sum = 7+1

We don't go around for the last time in the array

So that gives us the key positions that the numbers should be in

Now we just lookup the value as an index and increment the value in that index
                                                                     index   0, 1, 2, 3, 4, 5, 6, 7
alist[0] = 2, kp[2] = 2 (kp = kp[2] + 1 = 3) output_list = [_, _, 2, _, _, _, _, _ ]
alist[1] = 5, kp[5] = 7 (kp = kp[5] + 1 = 8) output_list = [_, _, _, _, _, _, _, 5 ]
alist[2] = 3, kp[4] = 4 (kp = kp[4] + 1 = 5) output_list = [_, _, _, _, _, 3, _, _ ]
alist[3] = 0, kp[0] = 0 (kp = kp[0] + 1 = 1) output_list = [0, _, _, _, _, _, _, _ ]
alist[4] = 2, kp[2] = 3 (kp = kp[2] + 1 = 4) output_list = [_, _, _, 2, _, _, _, _ ]
alist[5] = 3, kp[3] = 5 (kp = kp[3] + 1 = 6) output_list = [_, _, _, _, _, _, 3, _ ]
alist[6] = 0, kp[0] = 1 (kp = kp[0] + 1 = 2) output_list = [_, 0, _, _, _, _, _, _ ]
alist[7] = 3, kp[3] = 6 (kp = kp[3] + 1 = 7) output_list = [_, _, _, _, 3, _, _, _ ]
                                                             output_list = [0, 0, 2, 2, 3, 3, 3, 5 ]

Notice in this that in red i have highlighted the two indexes that have changed, this is because we already placed a number in the position that was there, so our next number is to the right of that one.

Some code for you to try out..


def key_positions(seq, key):
    array_items = []

    for items in seq:
        array_items.append(key(items))

    # find the max in the array
    max_value = max(array_items)

    # initialise with 0's
    count = [0] * (max_value + 1)

    # count occurances of integers
    for value in array_items:
        count[value] += 1

    # make the initial sum zero
    sum = 0
    print("size of count array = " + str(max_value + 1))
    # iterate over the length of our counting array
    for idx in range(0, len(count)):
        # save the current value we have in the array
        cur_val = count[idx]
        # put the current sum to the index pos in array
        count[idx] = sum
        print("index = {0}: sum = {1} kp = {2} current_value = {3} sum-> {1}+{3}".format(idx, sum, count, cur_val))
        # add the saved value to the sum, and make that the new sum
        sum = sum + cur_val

    print("index = {0}: sum = {1} kp = {2} current_value = {3} sum-> {1}+{3}".format(idx, sum, count, cur_val))

    return count

print(key_positions([2,5,3,0,2,3,0,3], lambda x: x))

Wednesday, 1 June 2016

Quick Hull in Python

So my assignment for Algorithms was on creating an implementation for  convex hulls using the Giftwrap Algorithm, the Graham-Scan Algorithm, and also another of our choosing.

Many chose to monotone hull as their third, i thought i would give another a go, searched around a bit and came up with an implementation called Quick hull which is based around the Quicksort algorithm for those who have come across it, where a part point is formed and sorted items go on one side and the part point is incremented as it continues through the items.

I found a few posts on the Internet about how it sort of works, but thought i would post my own commentary about it and hopefully provide some help to some poor person that comes across this.

So first up Quick hull uses recursion... if you aren't a fan of recursion, or don't enjoy it... you should go here

The algorithm needs a part line to split the points in your point cloud. So we choose the minimum x value and then the maximum x value. This essentially gives us a line through which to split the points left and right on.

Once we have found that line, we now need all the points on the left hand side of the line. At this point in time we don't care about the right hand side points. So we check each point min, max, pt to see if it does a counter clockwise turn (CCW), if it does then it's on the left side of the line, so we include it in our points list.

When that is finished, we now find in that points list, the point that has the furthest distance from the line, lets call that point ptC. Every point that is now in the  triangle formed by the points min,max,ptC can be ignored since they will never be part of the convex hull.

Call our quick hull function again with the new points list and change our line end points to that of min, ptc. This will then again find the points on the left and furthest point etc, eventually leaving us with just 2 sets of points, the minimum and the maximum, of which we want the maximum because that was the last furthest point from the line. Return the max and append to the convex hull points.

Now - that does the left hand side, all we have to do is to call the quick hull function again, passing in our points list and reverse the max, min points, and append that to the previous hull list.

And we're done.

Time for some Pseudocode i think, should see what i described a bit clearer:

 Def Get Hull Points (point list):  
   Find the min x, max in list of points  
   Hull pts = Quick Hull (point list, min, max)  
   Hull pts = Hull pts + Quick Hull (point list, max, min)  
   Return Hull pts  

 Def Quick Hull (point list, min, max)  
   New pt list = Find all the points left of the line (min, max)  
   ptC = A point on the left side with the greatest distance from the line  
   if a ptC was not found  
   then return the max point  
   Hull points = Quick Hull (New pt list, min, ptC)  
   Hull points = Hull points + Quick Hull (New pt list, max, ptC)  
   Return Hull points  


Ok - now we have the Psuedocode, we need some real code.

The language i implemented this in is python (version 3), but with the Psuedoocode above you should be able to translate it into which ever code you wish.
'''
    Quick Hull in Python
    Date: 01/06/2016
    Written by: Grant McEwan
    License: Beer license... you should buy me one if you make anything off this :)   

    This program produces a set of hull points using a similar method to the quick
    Sort Algorithm, so runs in O(n log n) time
'''


'''
    When called returns a list of points that forms a convex hull around 
    the listPts Given
'''
def get_hull_points(listPts):

    # get the min, and max from the list of points
    min, max = get_min_max_x(listPts)

    hullpts = quickhull(listPts, min, max)

    hullpts = hullpts + quickhull(listPts, max, min)

    return hullpts 

'''
    Does the sorting for the quick hull sorting algorithm
'''
def quickhull(listPts, min, max):
    left_of_line_pts = get_points_left_of_line(min, max, listPts)

    ptC = point_max_from_line(min, max, left_of_line_pts)

    if len(ptC) < 1:
        return [max]

    hullPts = quickhull(left_of_line_pts, min, ptC)

    hullPts = hullPts + quickhull(left_of_line_pts, ptC, max)

    return hullPts

'''
    Reterns all points that a LEFT of a line start->end
'''
def get_points_left_of_line(start, end, listPts):
    pts = []

    for pt in listPts:
        if isCCW(start, end, pt):
            pts.append(pt)

    return pts

'''
    Returns the maximum point from a line start->end
'''
def point_max_from_line(start, end, points):
    max_dist = 0

    max_point = []

    for point in points:
        if point != start and point != end:
            dist = distance(start, end, point)
            if dist > max_dist:
                max_dist = dist
                max_point = point

    return max_point

def get_min_max_x(list_pts):
    min_x = float('inf')
    max_x = 0
    min_y = 0
    max_y = 0

    for x,y in list_pts:
        if x < min_x:
            min_x = x
            min_y = y
        if x > max_x:
            max_x = x
            max_y = y

    return [min_x,min_y], [max_x,max_y]

'''
    Given a line of start->end, will return the distance that
    point, pt, is from the line.
'''
def distance(start, end, pt): # pt is the point
    x1, y1 = start
    x2, y2 = end
    x0, y0 = pt
    nom = abs((y2 - y1) * x0 - (x2 - x1) * y0 + x2 * y1 - y2 * x1)
    denom = ((y2 - y1)**2 + (x2 - x1) ** 2) ** 0.5
    result = nom / denom
    return result


Wednesday, 4 May 2016

Dropbox.. do it for free

So 2nd post... I'm still wondering about what to write about on blogs, i will try not to ramble or to moan about whatever assignment that i am doing (currently writing or extending a scanner for a compiler... weeee so much fun). But no guarantees

Anyhow - Dropbox. Yes indeed

So last year dropbox was quite handy, i hadn't formally decided how to do backups of school work.. well backups full stop really, but the school work was probably the most important.
I struggled a bit too with the idea of having to write code or work on the uni computers, and then magically remember to plug a flash drive in and write to it so i could carry on at home. So i still had masses of storage left in my dropbox from when i purchased my Galaxy S3. So decided that was the best route to take, since all i had to do was login from the uni computers and then drag and drop onto the webpage and it was done. Didn't need to worry about doin' my laptop cos i had the app installed and it just came down automagically ... yes.. its what the cloud does... magic.

So - like i said i dealt with this for a year, and then recently when my extra space "time" period expired, i was suddenly faced with the dropbox being full of all the photos from my phone camera (instant upload).

Here enter google! (hah-rah!)

I pondered the thought - can i run my own dropbox, and it turns out - yes, yes i can! I found some really nifty open source software called owncloud. Looks like a great piece of work. Very fast and very nice GUI, and most importantly very easy to install.

So - hah - my server is now paying for itself :P

There's a raft of android apps (and probably apple as well) that support it. I'm still looking a bit for an app that will synchronize my camera folder to the owncloud so that when i delete something locally it disappears from up there as well. The instant upload thing is great... until you have kids that hold down the capture button... and then you have to delete 25 fotos from 2 different locations.

Early days yet, but will see how it pans out.


Sunday, 1 May 2016

First post

Decided that i should create a blog, who knows what for, why knows who for. all of which doesn't really make sense. Which is how life kinda feels at the moment.

So.. 18 months ago i toyed with the idea, of going to university to change my career. I hadn't been to university. When i left school i went to polytech, which back then was always seen as a poor mans University, the place you go if you couldn't get entrance into university.
The idea grew in me, and pretty soon, at age 36 i took my life and turned it upside down (thanks fresh prince), and enrolled into university to do a BSc in computer science. This meant that i quit my job (of the last 9 years), sent the wife back to work... and prepared my 3 girls for more time with dad! (YAY! they said... yeah right).

I was pretty naive really. My first semester went really well, as my diploma gave me some credits towards my degree i only had to pick up 3 subjects, and the work load was easy, in fact.. most of it was generally programming which i had been doing for a number of years by myself anyhow... so i got this illusion that Uni life was going to be challenging but, not overly hard. I thought i was doing really well, balancing the family life, with personal life, with university life...

Shit.... was i wrong in semester two.

Things took a wayward turn as i struck Stats and Maths in the same semester. I am not the best at maths anyhow - but you know, you think you are... turns out at the end of semester 2, i really liked stats... who would have thought - maths (discrete) .. not so much tho, however, that's a story for another post altogether

So - half way thru semster one of year 2 now. It's so so really. Not doing nearly as well as i hoped for, but still hanging in there. As an adult student with a family - its time that is always against you...

Anyhow - it's late, i start back tomorrow after a 3 week term holiday that just feels like i haven't really stopped. So will do another post later.. but this is a good start i think.