Model

Model
It is a representation by which a problem, process, design , or analysis can be easily understood and the problem becomes simplified after modeling. 

Optimization of Memory

Optimization of Memory
Certain steps changed to reduce the need for memory and having a compact code. It reduces the total size of the memory needed. It also reduces the total number of CPU cycles, and thus, the total energy requirements.

Source Code Engineering Tool

Source Code Engineering Tool
A power tool to engineer source codes and also to help in debugging and performance analysis of the codes in high-level languages. 

Ordered List

Ordered List
A priority-wise ordered list in which it is easy to delete operations ( read and then set the pointer to next) . It is done sequentially , starting from top. 

Stack

Stack
A data structure in which elements can be pushed for saving in certain memory blocks and can be retrieved in a last-in first-out (LIFO) mode. It needs one pointer for the stack head (top) for deletion ( read and point to next element ) as well insertion. 

List

List
A data structure into which elements can be sequentially inserted and retrieved , no necessarily in the first-in-first-out or last-in-first-out mode. Each element has a pointer also which points to the address of the next element at the list. Last element points to NULL . A top(head) pointer points to its first element. 

Queue

Queue
A data structure into which elements can be sequentially inserted and retrieved  in a first-in-first-out mode (FIFO). It needs two pointers, one for the queue tail(back) for inserting and other for queue head(front) for deletion(read and point to next element)..