<?xml version="1.0" encoding="UTF-8"?>
<rss version="2.0"
	xmlns:content="http://purl.org/rss/1.0/modules/content/"
	xmlns:wfw="http://wellformedweb.org/CommentAPI/"
	xmlns:dc="http://purl.org/dc/elements/1.1/"
	xmlns:atom="http://www.w3.org/2005/Atom"
	xmlns:sy="http://purl.org/rss/1.0/modules/syndication/"
	xmlns:slash="http://purl.org/rss/1.0/modules/slash/"
	>

<channel>
	<title>bodom_lx at task3 dot cc &#187; data structures</title>
	<atom:link href="http://task3.cc/tag/data-structures/feed/" rel="self" type="application/rss+xml" />
	<link>http://task3.cc</link>
	<description>Trying to be mathematically simple and precise</description>
	<lastBuildDate>Thu, 18 Mar 2010 13:53:43 +0000</lastBuildDate>
	<generator>http://wordpress.org/?v=2.9.2</generator>
	<language>en</language>
	<sy:updatePeriod>hourly</sy:updatePeriod>
	<sy:updateFrequency>1</sy:updateFrequency>
			<item>
		<title>Announcing Dycapo 0.0.2</title>
		<link>http://task3.cc/1498/announcing-dycapo-0-0-2/</link>
		<comments>http://task3.cc/1498/announcing-dycapo-0-0-2/#comments</comments>
		<pubDate>Sun, 10 Jan 2010 20:39:52 +0000</pubDate>
		<dc:creator>bodom_lx</dc:creator>
				<category><![CDATA[Carpooling Research]]></category>
		<category><![CDATA[2010]]></category>
		<category><![CDATA[api]]></category>
		<category><![CDATA[bugs]]></category>
		<category><![CDATA[change]]></category>
		<category><![CDATA[Client]]></category>
		<category><![CDATA[code]]></category>
		<category><![CDATA[daniel]]></category>
		<category><![CDATA[data structures]]></category>
		<category><![CDATA[django]]></category>
		<category><![CDATA[document]]></category>
		<category><![CDATA[Download]]></category>
		<category><![CDATA[driver]]></category>
		<category><![CDATA[DyCaPo]]></category>
		<category><![CDATA[dynamic]]></category>
		<category><![CDATA[dynamic carpooling]]></category>
		<category><![CDATA[dynamic ridesharing]]></category>
		<category><![CDATA[FBK]]></category>
		<category><![CDATA[fix]]></category>
		<category><![CDATA[free software]]></category>
		<category><![CDATA[Free*]]></category>
		<category><![CDATA[gmail]]></category>
		<category><![CDATA[graziotin]]></category>
		<category><![CDATA[how]]></category>
		<category><![CDATA[HTTP]]></category>
		<category><![CDATA[HTTPS]]></category>
		<category><![CDATA[models]]></category>
		<category><![CDATA[OpenTrip]]></category>
		<category><![CDATA[page]]></category>
		<category><![CDATA[pro]]></category>
		<category><![CDATA[promise]]></category>
		<category><![CDATA[protocol]]></category>
		<category><![CDATA[prototype]]></category>
		<category><![CDATA[release]]></category>
		<category><![CDATA[research]]></category>
		<category><![CDATA[Serv]]></category>
		<category><![CDATA[server]]></category>
		<category><![CDATA[SoNet]]></category>
		<category><![CDATA[Wiki]]></category>
		<category><![CDATA[xml-rpc]]></category>

		<guid isPermaLink="false">http://task3.cc/?p=1498</guid>
		<description><![CDATA[As promised, Dycapo 0.0.2 is out. 
Dycapo will be an open client (mobile)/server system that will improve travel experiences of users in a city. The system will let people to define a destination on their mobile phone. DyCaPo will suggest and arrange trips by either using the Public Transport Service or Carpooling volunteers.
That is, DyCaPo [...]]]></description>
		<wfw:commentRss>http://task3.cc/1498/announcing-dycapo-0-0-2/feed/</wfw:commentRss>
		<slash:comments>1</slash:comments>
		</item>
		<item>
		<title>Announcing Dycapo 0.0.1</title>
		<link>http://task3.cc/1485/announcing-dycapo-0-0-1/</link>
		<comments>http://task3.cc/1485/announcing-dycapo-0-0-1/#comments</comments>
		<pubDate>Mon, 28 Dec 2009 22:24:10 +0000</pubDate>
		<dc:creator>bodom_lx</dc:creator>
				<category><![CDATA[Carpooling Research]]></category>
		<category><![CDATA[2009]]></category>
		<category><![CDATA[api]]></category>
		<category><![CDATA[code]]></category>
		<category><![CDATA[configuration]]></category>
		<category><![CDATA[daniel]]></category>
		<category><![CDATA[data structures]]></category>
		<category><![CDATA[django]]></category>
		<category><![CDATA[document]]></category>
		<category><![CDATA[Download]]></category>
		<category><![CDATA[driver]]></category>
		<category><![CDATA[DyCaPo]]></category>
		<category><![CDATA[dynamic]]></category>
		<category><![CDATA[dynamic carpooling]]></category>
		<category><![CDATA[dynamic ridesharing]]></category>
		<category><![CDATA[FBK]]></category>
		<category><![CDATA[free software]]></category>
		<category><![CDATA[gmail]]></category>
		<category><![CDATA[graziotin]]></category>
		<category><![CDATA[how]]></category>
		<category><![CDATA[HTTP]]></category>
		<category><![CDATA[HTTPS]]></category>
		<category><![CDATA[installation]]></category>
		<category><![CDATA[models]]></category>
		<category><![CDATA[OpenTrip]]></category>
		<category><![CDATA[page]]></category>
		<category><![CDATA[pro]]></category>
		<category><![CDATA[project]]></category>
		<category><![CDATA[release]]></category>
		<category><![CDATA[research]]></category>
		<category><![CDATA[SoNet]]></category>
		<category><![CDATA[Wiki]]></category>
		<category><![CDATA[xml-rpc]]></category>

		<guid isPermaLink="false">http://task3.cc/?p=1485</guid>
		<description><![CDATA[It&#8217;s a pleasure for me to announce Dycapo-0.0.1, the very first release of the project.
Dycapo-0.0.1 is part of the pre-alpha-dontuse releases, to only illustrate some functionalities.
Here are the release notes:

2009-12-26  Daniel Graziotin  &#60;daniel DOT graziotin AT gmail DOT com&#62;
Dycapo 0.0.1 is just for showing out some functionalities of the system and
testing the underlying [...]]]></description>
		<wfw:commentRss>http://task3.cc/1485/announcing-dycapo-0-0-1/feed/</wfw:commentRss>
		<slash:comments>0</slash:comments>
		</item>
		<item>
		<title>Introduction to Functional Programming</title>
		<link>http://task3.cc/1136/introduction-to-functional-programming/</link>
		<comments>http://task3.cc/1136/introduction-to-functional-programming/#comments</comments>
		<pubDate>Tue, 16 Jun 2009 10:04:31 +0000</pubDate>
		<dc:creator>bodom_lx</dc:creator>
				<category><![CDATA[Programming]]></category>
		<category><![CDATA[Unibz]]></category>
		<category><![CDATA[2009]]></category>
		<category><![CDATA[data structures]]></category>
		<category><![CDATA[Design]]></category>
		<category><![CDATA[Download]]></category>
		<category><![CDATA[freemind]]></category>
		<category><![CDATA[functional programming]]></category>
		<category><![CDATA[HTTP]]></category>
		<category><![CDATA[java]]></category>
		<category><![CDATA[javascript]]></category>
		<category><![CDATA[language]]></category>
		<category><![CDATA[mind]]></category>
		<category><![CDATA[mindmap]]></category>
		<category><![CDATA[page]]></category>
		<category><![CDATA[pageTracker]]></category>
		<category><![CDATA[PNG]]></category>
		<category><![CDATA[pro]]></category>
		<category><![CDATA[programming paradigm]]></category>
		<category><![CDATA[programming paradigms]]></category>
		<category><![CDATA[publication]]></category>
		<category><![CDATA[rest]]></category>
		<category><![CDATA[source]]></category>
		<category><![CDATA[summary]]></category>
		<category><![CDATA[Wiki]]></category>
		<category><![CDATA[wikipedia]]></category>

		<guid isPermaLink="false">http://task3.cc/?p=1136</guid>
		<description><![CDATA[For the Programming Paradigms course we had to study the concepts of Functional Programming.
So here is my usual mindmap regarding the topic. This is just a summary of the most important concepts of functional programming. It also summarizes the very well-written Functional Programming for the Rest of us publication, and uses its pseudo-Java language.
Topics covered:

Definition
Basic [...]]]></description>
		<wfw:commentRss>http://task3.cc/1136/introduction-to-functional-programming/feed/</wfw:commentRss>
		<slash:comments>0</slash:comments>
		</item>
		<item>
		<title>Hash Maps with linear probing and separate chaining</title>
		<link>http://task3.cc/308/hash-maps-with-linear-probing-and-separate-chaining/</link>
		<comments>http://task3.cc/308/hash-maps-with-linear-probing-and-separate-chaining/#comments</comments>
		<pubDate>Mon, 28 Apr 2008 09:55:20 +0000</pubDate>
		<dc:creator>bodom_lx</dc:creator>
				<category><![CDATA[Programming]]></category>
		<category><![CDATA[address]]></category>
		<category><![CDATA[algorithms]]></category>
		<category><![CDATA[C language]]></category>
		<category><![CDATA[code]]></category>
		<category><![CDATA[data structures]]></category>
		<category><![CDATA[Download]]></category>
		<category><![CDATA[hash]]></category>
		<category><![CDATA[hash map]]></category>
		<category><![CDATA[hash table]]></category>
		<category><![CDATA[HTTP]]></category>
		<category><![CDATA[java]]></category>
		<category><![CDATA[javascript]]></category>
		<category><![CDATA[link]]></category>
		<category><![CDATA[list]]></category>
		<category><![CDATA[page]]></category>
		<category><![CDATA[pageTracker]]></category>
		<category><![CDATA[php]]></category>
		<category><![CDATA[pro]]></category>
		<category><![CDATA[rest]]></category>
		<category><![CDATA[source]]></category>
		<category><![CDATA[source code]]></category>
		<category><![CDATA[Wiki]]></category>
		<category><![CDATA[wikipedia]]></category>

		<guid isPermaLink="false">http://task3.cc/?p=308</guid>
		<description><![CDATA[Time for two new C programs! At the DSA course I learned something about Hash Tables and collision resolutions.
I just implemented insert/search/print operations.
The first source code is an implementation of a Hash Map with open addressing (linear probing) as collision resolution method.
The following are the interesting functions of the program. As always, take a look [...]]]></description>
		<wfw:commentRss>http://task3.cc/308/hash-maps-with-linear-probing-and-separate-chaining/feed/</wfw:commentRss>
		<slash:comments>1</slash:comments>
		</item>
		<item>
		<title>BD-shell</title>
		<link>http://task3.cc/projects/bd-shell/</link>
		<comments>http://task3.cc/projects/bd-shell/#comments</comments>
		<pubDate>Mon, 21 Apr 2008 10:46:30 +0000</pubDate>
		<dc:creator>bodom_lx</dc:creator>
				<category><![CDATA[My Life]]></category>
		<category><![CDATA[academic]]></category>
		<category><![CDATA[aria]]></category>
		<category><![CDATA[background command]]></category>
		<category><![CDATA[BD-shell]]></category>
		<category><![CDATA[Beta]]></category>
		<category><![CDATA[beta release]]></category>
		<category><![CDATA[Blog]]></category>
		<category><![CDATA[bugs]]></category>
		<category><![CDATA[candidate]]></category>
		<category><![CDATA[change]]></category>
		<category><![CDATA[code]]></category>
		<category><![CDATA[data structures]]></category>
		<category><![CDATA[DELETE]]></category>
		<category><![CDATA[document]]></category>
		<category><![CDATA[Download]]></category>
		<category><![CDATA[fix]]></category>
		<category><![CDATA[free software]]></category>
		<category><![CDATA[gpl]]></category>
		<category><![CDATA[HEAD]]></category>
		<category><![CDATA[HTTP]]></category>
		<category><![CDATA[HTTPS]]></category>
		<category><![CDATA[java]]></category>
		<category><![CDATA[javascript]]></category>
		<category><![CDATA[job]]></category>
		<category><![CDATA[layout]]></category>
		<category><![CDATA[link]]></category>
		<category><![CDATA[linux]]></category>
		<category><![CDATA[list]]></category>
		<category><![CDATA[Mac Os]]></category>
		<category><![CDATA[mac os x]]></category>
		<category><![CDATA[page]]></category>
		<category><![CDATA[pageTracker]]></category>
		<category><![CDATA[personal]]></category>
		<category><![CDATA[php]]></category>
		<category><![CDATA[pro]]></category>
		<category><![CDATA[project]]></category>
		<category><![CDATA[PUT]]></category>
		<category><![CDATA[rc2]]></category>
		<category><![CDATA[release]]></category>
		<category><![CDATA[release candidate]]></category>
		<category><![CDATA[report]]></category>
		<category><![CDATA[set]]></category>
		<category><![CDATA[shell]]></category>
		<category><![CDATA[sid]]></category>
		<category><![CDATA[signal handlers]]></category>
		<category><![CDATA[Signals]]></category>
		<category><![CDATA[source]]></category>
		<category><![CDATA[standard]]></category>
		<category><![CDATA[System Calls]]></category>
		<category><![CDATA[Unibz]]></category>
		<category><![CDATA[university]]></category>
		<category><![CDATA[unix]]></category>
		<category><![CDATA[unix shell]]></category>
		<category><![CDATA[URI]]></category>
		<category><![CDATA[variables]]></category>
		<category><![CDATA[version]]></category>
		<category><![CDATA[Wiki]]></category>
		<category><![CDATA[wikipedia]]></category>

		<guid isPermaLink="false">http://task3.cc/?page_id=307</guid>
		<description><![CDATA[BD-shell (a.k.a. bdsh) is a tiny Unix shell written in C. It&#8217;s a project required for the Operating System Course at my University.
It is written using a clean coding style, following xP coding standard philosophy.
Version 1.0 is the release that satisfies all the course requirements!


Quick Jump:
Features
Download
License


Features
Cool Features

Lightweight
Implements real Job Control
Clear and understandable code, ideal for [...]]]></description>
		<wfw:commentRss>http://task3.cc/projects/bd-shell/feed/</wfw:commentRss>
		<slash:comments>0</slash:comments>
		</item>
		<item>
		<title>A Generic Quicksort Implementation in C</title>
		<link>http://task3.cc/295/a-generic-quicksort-implementation-in-c/</link>
		<comments>http://task3.cc/295/a-generic-quicksort-implementation-in-c/#comments</comments>
		<pubDate>Mon, 07 Apr 2008 09:58:42 +0000</pubDate>
		<dc:creator>bodom_lx</dc:creator>
				<category><![CDATA[Programming]]></category>
		<category><![CDATA[algorithms]]></category>
		<category><![CDATA[C language]]></category>
		<category><![CDATA[code]]></category>
		<category><![CDATA[data structures]]></category>
		<category><![CDATA[Design]]></category>
		<category><![CDATA[Download]]></category>
		<category><![CDATA[HTTP]]></category>
		<category><![CDATA[java]]></category>
		<category><![CDATA[javascript]]></category>
		<category><![CDATA[language]]></category>
		<category><![CDATA[page]]></category>
		<category><![CDATA[pageTracker]]></category>
		<category><![CDATA[php]]></category>
		<category><![CDATA[rest]]></category>
		<category><![CDATA[source]]></category>
		<category><![CDATA[source code]]></category>
		<category><![CDATA[version]]></category>
		<category><![CDATA[Wiki]]></category>
		<category><![CDATA[wikipedia]]></category>

		<guid isPermaLink="false">http://task3.cc/?p=295</guid>
		<description><![CDATA[As assignment for Data Structures and Algorithms course, we had to work with a modified version of the quicksort algorithm. It came obvious that for modifying a qsort you need to implement it  
It is difficult to find a clear quicksort algorithm implemented, so I wrote it.
Here is the generic C implementation of the [...]]]></description>
		<wfw:commentRss>http://task3.cc/295/a-generic-quicksort-implementation-in-c/feed/</wfw:commentRss>
		<slash:comments>0</slash:comments>
		</item>
		<item>
		<title>Two IT guys and DSA assignments</title>
		<link>http://task3.cc/281/two-it-guys-and-dsa-assignments/</link>
		<comments>http://task3.cc/281/two-it-guys-and-dsa-assignments/#comments</comments>
		<pubDate>Sat, 15 Mar 2008 23:18:39 +0000</pubDate>
		<dc:creator>bodom_lx</dc:creator>
				<category><![CDATA[Misc]]></category>
		<category><![CDATA[Unibz]]></category>
		<category><![CDATA[algorithms]]></category>
		<category><![CDATA[data structures]]></category>
		<category><![CDATA[HTTP]]></category>
		<category><![CDATA[life]]></category>
		<category><![CDATA[university]]></category>

		<guid isPermaLink="false">http://task3.cc/two-it-guys-and-dsa-assignments/</guid>
		<description><![CDATA[This is what happens if you give to two IT students a stressful assignment of &#8220;Data Structures
and Algorithms&#8221;, 48 hours of their meaningful life, the loss of a saturday night, and the 6th
floor of the most recent building of the Free University of Bolzano:

..they begin to behave like real IT guys..and to build their ideal [...]]]></description>
		<wfw:commentRss>http://task3.cc/281/two-it-guys-and-dsa-assignments/feed/</wfw:commentRss>
		<slash:comments>0</slash:comments>
		</item>
		<item>
		<title>Sorting array elements with C language</title>
		<link>http://task3.cc/274/sorting-array-elements-with-c-language/</link>
		<comments>http://task3.cc/274/sorting-array-elements-with-c-language/#comments</comments>
		<pubDate>Sat, 23 Feb 2008 14:09:59 +0000</pubDate>
		<dc:creator>bodom_lx</dc:creator>
				<category><![CDATA[Programming]]></category>
		<category><![CDATA[algorithms]]></category>
		<category><![CDATA[C language]]></category>
		<category><![CDATA[code]]></category>
		<category><![CDATA[data structures]]></category>
		<category><![CDATA[Download]]></category>
		<category><![CDATA[elements of]]></category>
		<category><![CDATA[HTTP]]></category>
		<category><![CDATA[java]]></category>
		<category><![CDATA[javascript]]></category>
		<category><![CDATA[language]]></category>
		<category><![CDATA[page]]></category>
		<category><![CDATA[pageTracker]]></category>
		<category><![CDATA[php]]></category>
		<category><![CDATA[pointer]]></category>
		<category><![CDATA[pointers]]></category>
		<category><![CDATA[pro]]></category>
		<category><![CDATA[PUT]]></category>
		<category><![CDATA[rest]]></category>
		<category><![CDATA[source]]></category>
		<category><![CDATA[source code]]></category>
		<category><![CDATA[tiny c]]></category>
		<category><![CDATA[Unibz]]></category>
		<category><![CDATA[Wiki]]></category>
		<category><![CDATA[wikipedia]]></category>

		<guid isPermaLink="false">http://task3.cc/sorting-array-elements-with-c-language/</guid>
		<description><![CDATA[UPDATE 17:19: it seems that the program I implemented today uses a kind of Bubble Sort algorithm, give it a try, it&#8217;s quite interesting!
After 3 long days studying C, I think I&#8217;ve assimilated a good knowledge base for the incoming semester.
So there is a tiny C program that sorts the elements of a given integer [...]]]></description>
		<wfw:commentRss>http://task3.cc/274/sorting-array-elements-with-c-language/feed/</wfw:commentRss>
		<slash:comments>3</slash:comments>
		</item>
	</channel>
</rss>
