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“.

Read more »

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

NAME.h

_PROTOTYPE(int FUNCTION_NAME, (int PARAM));

Read more »

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 time of add each one. But i think it is something wrong.

B-Tree

Best Regards,
Matheus

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

Read more »

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

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

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

Good afternoon,

Like I said before I’m having Data Structure class. And today I will introduce you the List concept. A linear data structure. There is similar data structures like linked list, double linked list. The stack and the queue are special implementations of lists. The list can receive elements in any position, remove elements from any position, remove a specified element, add in order and others.

The professor told us to solve this:

1. Create the data type tLista in a headerfile
2. This list must be a list of elements of tAgenda
3. The type tAgenda is a type that represents a name (30 chars) and a telephone number
4. Create a function maior(a,b) that compare the name of 2 entries
5. Implement all the functions
6. Create a program that have a menu to use all functions and the specified search must use the name.
7. The program should be able to show the list in alphabetic order

List implementation.

Regards,
Matheus

Good Night,

What is Queue? Queue is a data structure used a lot in computers, and it is based on the principle FIFO (First in, first out). It has 2 basic functions, enqueue and denqueue. What is First in, First out? It says that the first element that enter in the data structure is the first to be removed.

The professor told us to solve this:

* Implement all operations about Queue.
* Implement a program that use your Queue. The program must have a menu with: enqueue, dequeue, clean, show queue, exit. Use switch.
* The queue must have max size of 100. As a constant named MAXFILA
* The queue is referenced by a global reference.
* To define it use a type elementoDaFila that will be char[40] and define your queue as a vector of 100 elementoDaFila.

Queue implementation.

Regards,
Matheus

PS: I start translating “all” old posts. Maybe this old ones, don’t have all stuffs translated (like attachments in this one)

Good Night,

What is Stack? Stack is a data structure of abstract data used a lot in computers, and it is based on the principle LIFO (Last in, first out). It has 2 basic functions, push and pop. It is simple right?

The professor told us to solve this:

* Implement all operations about stack.
* Implement a program that use your stack. The program must have a menu with: pop, push, clean, show stack, exit. Use switch.
* When the program show each element from stack it must show the position of the stack.
* The stack must have max size of 30. As a constant named MAXPILHA
* The stack is referenced by a global reference.

Stack, first implementation.

Regards,
Matheus

PS: I start translating “all” old posts. Maybe this old ones, don’t have all stuffs translated (like attachments in this one)

Hello,

This semester I have data structure class, my professor Aldo Von Wangenheim, decided to use C in the first part of the class, and in the end C++. If you don’t know it, he recommended this C course. He asked us to solve some exercices. Me and my colleague solved it and I’m uploading it here.

5 exercices for begginers (Portuguese)
Implementation of exercices

Regards,
Matheus

PS: I start translating “all” old posts. Maybe this old ones, don’t have all stuffs translated (like attachments in this one)