The brief for my final assignment is:

Your task is to write any application you like. The are no restrictions on what your application can do but it should show of the capabilities of the platform and be well written.

Marks will be awarded for interesting applications that make good use of the Android platform.

Make sure your application works on the emulator but I will also test it on a real device.

For this assignment I decided to create a Blog Reader that reads the RSS XML feeds off blogs to display them in a Android Application.
I have spent around three days coding this assignment. I will not release the code until after the assignment has been marked, however here are some screen shots of the work

My Application Sitting in the Android Application Menu on my phone

The applications home screen

Adding a new blog feed into the application

Viewing a list of blogs

Removing a blog feed

Viewing a list of blog posts

Viewing list of blog posts

Viewing single post

These strings come into the program unsorted and they must be sorted and each one must be unique. (i.e. no duplicates).

Now there are a few different ways to be able to store this data.

A SortedList, SortedDictionary, or two different forms of lists, the first where before each add you check to make sure that the data doesn’t already exist, and the second where you just add then sort then remove duplicates at a later time.

Two work out what one would be best I wrote a program to determine which form of storage operated the fastest on input. The results follow and then the code for how I did it.

As you can see the SortedDictionary worked the best, however at the early stages both the SortedList and Duplicate List gave it a run for it’s money.

Results

Sorted List Test:        00:00:00.1169883 Input:    5000    4000 List Size:    2838
Sorted Dictionary Test:  00:00:00.1339866 Input:    5000    4000 List Size:    2858
Unique List Test:        00:00:00.1119888 Input:    5000    4000 List Size:    2862
Duplicate List Test:     00:00:00.0239976 Input:    5000    4000 List Size:    2832

Sorted List Test:        00:00:01.3768623 Input:   50000   40000 List Size:   28516
Sorted Dictionary Test:  00:00:01.0678932 Input:   50000   40000 List Size:   28466
Unique List Test:        00:00:12.3097689 Input:   50000   40000 List Size:   28384
Duplicate List Test:     00:00:01.2058794 Input:   50000   40000 List Size:   28549

Sorted List Test:        00:01:36.9733017 Input:  500000  400000 List Size:  285367
Sorted Dictionary Test:  00:00:12.3307668 Input:  500000  400000 List Size:  285422
Duplicate List Test:     00:02:32.7467238 Input:  500000  400000 List Size:  285506

Sorted Dictionary Test:  00:02:37.8040000 Input: 5000000 4000000 List Size: 2854095

Code for Program.cs

using System;
using System.Collections.Generic;
using System.Text;

namespace SortTest
{
class Program
{
public static void Main()
{
// 5,000 item list
SortedListTest.run(5000,4000);
SortedDictionaryTest.run(5000, 4000);
UniqueListTest.run(5000, 4000);
DuplicateListTest.run(5000, 4000);

// 50,000 item list
SortedListTest.run(50000, 40000);
SortedDictionaryTest.run(50000, 40000);
UniqueListTest.run(50000, 40000);
DuplicateListTest.run(50000, 40000);

// 500,000 item list
SortedListTest.run(500000, 400000);
SortedDictionaryTest.run(500000, 400000);
//UniqueListTest.run(500000, 400000);
DuplicateListTest.run(500000, 400000);

// 5,000,000 item list
//SortedListTest.run(5000000, 4000000);
SortedDictionaryTest.run(5000000, 4000000);
//UniqueListTest.run(5000000, 4000000);
//DuplicateListTest.run(5000000, 4000000);

}
}
}

Code for SortedListTest.cs
using System;
using System.Collections.Generic;
using System.Text;

namespace SortTest
{
class SortedListTest
{
private static SortedList words = null;

public static void run(int loopSize, int multiplier)
{
words = new SortedList();
DateTime startTime = DateTime.Now;
Random rand = new Random();
int i;
for (int j = 0; j != loopSize; j++)
{
i = (int)(rand.NextDouble() * multiplier);
try
{
string s = i.ToString();
words.Add(s, s[0]);
}
catch (Exception e)
{
continue;
}
}
DateTime stopTime = DateTime.Now;
TimeSpan duration = stopTime - startTime;
Console.WriteLine("Sorted List Test: " + duration.ToString() + " Input: " + loopSize + " " + multiplier + " List Size: " + words.Count);
}
}
}

Code for SortedDictionaryTest.cs

using System;
using System.Collections.Generic;
using System.Text;

namespace SortTest
{
class SortedDictionaryTest
{
private static SortedDictionary words = null;

public static void run(int loopSize, int multiplier)
{
words = new SortedDictionary();
DateTime startTime = DateTime.Now;
Random rand = new Random();
int i;
for (int j = 0; j != loopSize; j++)
{
i = (int)(rand.NextDouble() * multiplier);
try
{
string s = i.ToString();
words.Add(s, s[0]);
}
catch (Exception e)
{
continue;
}
}
DateTime stopTime = DateTime.Now;
TimeSpan duration = stopTime - startTime;
Console.WriteLine("Sorted Dictionary Test: " + duration.ToString() + " Input: " + loopSize + " " + multiplier + " List Size: " + words.Count);
}
}
}

Code for UniqueListTest.cs

using System;
using System.Collections.Generic;
using System.Text;

namespace SortTest
{
class UniqueListTest
{
private static List words = null;

public static void run(int loopSize, int multiplier)
{
words = new List();
DateTime startTime = DateTime.Now;
Random rand = new Random();
int i;
for (int j = 0; j != loopSize; j++)
{
i = (int)(rand.NextDouble() * multiplier);
try
{
string s = i.ToString();
bool matchfound = false;
foreach (string w in words) // ignore duplicates
{

if (w == s)
{
matchfound = true;
break;
}
}
if (!matchfound) words.Add(s);
}
catch (Exception e)
{
continue;
}
}
words.Sort();
DateTime stopTime = DateTime.Now;
TimeSpan duration = stopTime - startTime;
Console.WriteLine("Unique List Test: " + duration.ToString() + " Input: " + loopSize + " " + multiplier + " List Size: " + words.Count);
}
}
}

Code for DuplicateListTest.cs

using System;
using System.Collections.Generic;
using System.Text;

namespace SortTest
{
class DuplicateListTest
{

private static List words = null;

public static void run(int loopSize, int multiplier)
{
words = new List();
DateTime startTime = DateTime.Now;
Random rand = new Random();
int i;
for (int j = 0; j != loopSize; j++)
{
i = (int)(rand.NextDouble() * multiplier);
try
{
string s = i.ToString();
words.Add(s);
}
catch (Exception e)
{
continue;
}
}
words.Sort();
string prev = null;
for(int counter = 0; counter < words.Count; counter++)
{

if (prev == words[counter])
{
words.RemoveAt(counter);
counter--;
}
prev = words[counter];
}
DateTime stopTime = DateTime.Now;
TimeSpan duration = stopTime - startTime;
Console.WriteLine("Duplicate List Test: " + duration.ToString() + " Input: " + loopSize + " " + multiplier + " List Size: " + words.Count);
}
}
}

This morning on my internship I was cleaning up some code I had written last friday and making sure everything worked as planned.

While checking some of the output of the program I came accross this word: Reabsorbsinged. I thought it looked a little odd and upon closer inspection of the code I found out why.

The word Reabsorbsinged is made up of one base word: absorb. From this you can combine prefix and suffix to build more words e.g. Reabsorb, Absorbs, Reabsorbs etc.

However in my blind coding last week I had failed to realise a cruicial mistake I had made when trying to take a shortcut. I had fed my input variable into a function and overwritten it at the sametime. This is a good trick if you want to minimise memory and you don’t need to worry if you input variable is overwritten.

Unfortunately I needed my input variable to stay intact to be able to generate the other words (like above). Instead I ended up with just one huge word: re+absorb+s+ing+ed So like you end up with dick of the day in some jobs I now have word of the day.

And on an entirely different note:

I am currently converting the code that generated this mistake from c++ to c#. Easy enough C# is pretty similar to java and doesn’t have pointers, yes! However as I discovered it doesn’t have a string reverse function either.

Glancing on the internet there are a few around pretty much going from extremely long and memory expensive, i.e. copying each character onto a new string at each step, or extremely quick but near impossible to read, understand or debug. So I got smart and wrote my on.

The code was a long the lines of this:


string normalString = "abcdef";
char[] tempString = normalString.toCharArray();
for(int i=0; i < tempString.length / 2; i++) {
char tempc = tempString[i];
tempString[i] = tempString[tempString.length - i -1];
tempString[tempString.length - i - 1] = tempc;
}
string reversedString = tempString.ToString();


NZTA was told in mid December they had security issues but did nothing.

http://www.nzherald.co.nz/technology/news/article.cfm?c_id=5&objectid=10550914

On January 25 the Silverdale to Puhoi motorway extension will open, however to drive on it you will need to pay tolls, and for the last two months or so the NZTA have been advertising the www.tollroad.govt.nz website heavily so regulary uses of the new road can set up accounts.

On Monday a computer user realised that the website was not encrypting credit card information which means that anyone who knows anything about packet snifting or the like could intercept peoples credit card details as they used the website.

Now first and foremost this should never happen. Not on any ecommerce site, let alone a government website. Ecommerce programing 101 would surely teach you that first you must always encrypt data through using SSL and HTTPS not plain HTTP.

But what was more funny is that the red faced NZTA denied that there was anything wrong with the site! Refusing to take it offline or stop processing accounts.

That was until today when with egg on their face they took down the site for maintenance and admitted they stuffed up. Time to get new programmers one thinks.

Read more here:

http://www.nzherald.co.nz/connect/news/article.cfm?c_id=1501833&objectid=10550614

and

http://www.nzherald.co.nz/nz/news/article.cfm?c_id=1&objectid=10550744

Currently some of the team in Computer Science at Massey have been playing with JOGL.

I had a look at it the other day but didn’t get very far. Well tonight I decided to really get my hands dirty.

And it rocks! Im currently seeing if I can convert my traffic simulator to JOGL.

Will keep this blog posted on updates.

$url = $_SERVER['HTTP_HOST'];
if(strpos( strtolower($url), “site2″ )!=FALSE) {
header(‘location:site2/index.php’);
} else {
header(‘location:site1/index.php’);
}

It is not often that code makes me happy.

The changes in summary:

New:

• Blog comments are back – provided I don’t get too much spam they will stay.
• Java Web Start for software section
• Text versions of many articles

Updated:

• About me page
• Articles portfolio
• Website portfolio
• Software portfolio
• Photos

Deleted:

• Homepage – Replaced with blog
• Outdoor Activities
• Links – Blogroll will be its replacement
• Other stuff I can’t remember