REFLICTION PRELIM TOPICS

for me im i have a lot to learn to this subject 
also im injoyed to lesining sir mark the way he talk and to expliane to us
what he talking a bout the topics
i wish i will passed to this subject
and i hope sir mark they have a lot a patince of some students sometimes dont have a inetiative.

DATA STRUCTURE PRELIM TOPIC

ARRAYS-Arrays are analogous to the mathematical concepts of vectors, matrices, and tensors. Indeed, arrays with one or two indices are often called vectors or matrices, respectively. Arrays are often used to implement tables, especially lookup tables; the word table is sometimes used as a synonym of array.

STACKS-A stack is a restricted data structure, because only a small number of operations are performed on it. The nature of the pop and push operations also means that stack elements have a natural order.


QUEVES-

LINKED LIST-

Linked lists are among the simplest and most common data structures. They can be used to implement several other common abstract data structures, including stacks, queues, associative arrays, and symbolic expressions, though it is not uncommon to implement the other data structures directly without using a list as the basis of implementation.

REFLECTION IN PRELIM TOPICS

To create own program and to run the data wich were when how to process the data. i wish to be passed to this subject

i well agree they when he teach to expliane

So that i have a lot to learn thise subject i wish sir mark they have a patience a student . because sometimes they have some of student don’t have a inichative.