C | Matheus Bratfisch

Compile to Teensy 3.0 on Windows using Makefile

Published by Matheus (X-warrior) Bratfisch on January 9, 2013

Good Night, If you don't want to use Arduino IDE (Or Teensy IDE? 😉 to programming and uploading your code to Teensy 3.0 you can…

Continue reading Compile to Teensy 3.0 on Windows using Makefile

Add method to VFS in Minix.

Published by Matheus (X-warrior) Bratfisch on August 11, 2010

Good Night,

First of all, what is VFS? VFS means Virtual File System. It is a layer that exists in a lot of OS and in Minix too, this layer takes care of the communication with the File System. It is a Master's thesis in Computer Science from Balázs Gerófi and the name is "Design and implementation of the MINIX Virtual File system".

Continue reading Add method to VFS in Minix.

Creating a system library in Minix.

Published by Matheus (X-warrior) Bratfisch on July 26, 2010

First of all go to /usr/src/include and create a header file with this structure:

NAME.h

_PROTOTYPE(int FUNCTION_NAME, (int PARAM));

Continue reading Creating a system library in Minix.

B Tree, Data Structure

Published by Matheus (X-warrior) Bratfisch on July 1, 2009

Hello This is a implementation of B-Tree. This program read a list of ZipCodes and insert then in a Tree, and it should calculate the…

Continue reading B Tree, Data Structure

Linked List, Data Structure

Published by Matheus (X-warrior) Bratfisch on May 6, 2009

Hello,

What is a Linked List? Linked-list is a list that each element has a pointer to the next one.

The professor once again send us an enunciation to solve and it is too big. And I will not translate it. Inside the problem it have a Linked list.

Problem using linked-list..

Regards,
Matheus

PS: You can see the enunciation in portuguese and then use google translate to translate it

Continue reading Linked List, Data Structure

List, with pointers, Data Structure

Published by Matheus (X-warrior) Bratfisch on April 29, 2009

Hello,

Today I will introduce you to a list using pointers. This list doesn't have limit of elements (if you have infinite memory). Again the enunciation is too big, so take the file, read it and learn.

Stack with pointers implementation

Regards,
Matheus

PS: You can see the enunciation in portuguese and then use google translate to translate it
Continue reading List, with pointers, Data Structure

Stack, using pointer, Data Structure.

Published by Matheus (X-warrior) Bratfisch on April 28, 2009

This is a implementation of a Stack using pointers. The basic thing is the structure of tPilha is

[code lang="C"]
constant MAXPILHA = 100;
tipo tPilha {
inteiro dados[MAXPILHA];
inteiro *topo;
}; [/code]

Where *topo is a pointer to the first element in the stack. When you`re going to add a new one you verify if the stack is full, if it ins`t you put the data in a position in the stack and change the *topo. When removing, you decrement one in pointer *topo. Then it will reference the element that was there before.

(I had an enunciation but it was too big to translate)

stack with pointers implementation!

Regards,
Matheus

PS: You can see the enunciation in portuguese and then use google translate to translate it
Continue reading Stack, using pointer, Data Structure.