I'm cursing Computer Organization given by Luiz C. V. Santos. The book used in this class is "Computer Organization and Design: The hardware/software interface", and I have the portuguese book so I created a conversion table from the english book to the portuguese.
Too see the conversion see the complete post.
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.
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.
Regards,
Matheus
PS: I start translating “all” old posts. Maybe this old ones, don’t have all stuffs translated (like attachments in this one)
