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)

Today I will introduce you a programming language that the professor Fernando (Melga) uses in his class.

Telis is a programming language like many others, but it has its advantages for beginners, most of your commands are write in Portuguese (don't know if it have an english version), and the word means what happens (like draw means draw). It includes a simple graphic support , easy to use, letting the learning process more interesting. With it, it is possible public in internet your programs, the Edugraf, that develop this language provides a space in their server, in the programming environment you can upload it, just with some clicks. They provide a mail list where you can ask for help;

Some usefull links:
An example that I devolop
Language web page
Published programms
Mail list

And remember, Telis is free software. Use it, modify it, share it.

See you,
Matheus