Tag Archives: link

La portabilità del codice esiste o no?

Immaginate questo pensiero contornato da mille bestemmie.. Perchè uno straccio di programma in C che usa si e no 10 syscalls e un signal handler (tutto standard), compilato con gcc 4.0.1 sotto Mac Os X Leopard, quindi certificato Unix 03, e perfettamente funzionante…NON FUNZIONI su Gnu/Linux 2.6.18 + gcc 4.1.2 e Gnu/Linux 2.6.24 + gcc

Hash Maps with linear probing and separate chaining

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,

BD-shell

BD-shell (a.k.a. bdsh) is a tiny Unix shell written in C. It’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

Insertion Sort on Linked Lists

I’m pleased to publish this insertion sort implementation on single linked lists developed with my collegue Rigel. It’s a nice experiment in asymptotic complexity of O(n^3). The high complexity is due to the necessity of retrieving the neighbours of the node handled, a difficult operation when using single linked lists. Download: Insertion Sort on Single

OO Memory Management Model summary updated

Today I wrote a new version of my summary posted here. The new version covers more topics, here is the updated list: Memory portions assigned to a program (code area, heap / dynamic memory area), execution stack How code is loaded in Java The Activation Record (AR) and function calls Abbrevations (AR, RV, RA, SP,

Object Oriented Memory Management

Major Update on 10th April 2009, inclusion of C++ programming language! Updated on 18th April 2008, a complete example on stack and heap Updated on 15th April 2008, new contents and new layout! Updated on 6th April 2008, new contents! The paper you can download from here is about a model for memory management during