Research for applications

Where the following is implemented:

• Linked list - is a data structure consisting of a group of nodes which together represent a sequence.

• Queue - is a particular kind of abstract data type or collection in which the entities in the collection are kept in order and the principal (or only) operations on the collection are the addition of entities to the rear terminal position and removal of entities from the front terminal position.

• Stack - is a last in, first out abstract data type and linear data structure.                                            
• Array - is a data structure consisting of a collection of elements, each identified by at least one index.
• 

Reflections in Prelim Topics

It seems for me that our topics are hard, because I came in late in our class. Just last week that I came in our class because of a problem about my papers in school. Then next week is our exam, I will do my best to catch up in our lessons and learn more about our topics.