Data Structure and Algorithm

An organization of information, usually in memory, for better algorithm efficiency, such as queue, stack, linked list, heap, dictionary, and tree, or conceptual unity, such as the name and address of a person. It may include redundant information, such as length of the list or number of nodes in a sub tree. And algorithm is a computable set of steps to achieve a desired result.

It is important to study due to following facts:

1) To identify and develop useful mathematical entities and operation to determine what classes of problems can be solved by using these entities and operations.
2) To determine representations for those abstract entities and to implement the abstract operations on these concrete representations.
3) To save computer memory because the memory of the computer is limited.
4) To maintain the execution time of the program, which determines the efficiency