State transition function
A process or state of codes that carry a program state from one to another.
A process or state of codes that carry a program state from one to another.
Monday, August 19, 2013
Finite State Machine
Finite State Machine
A model in which there are finite states. After a given set of inputs, a state changes according to the state transition function.
A model in which there are finite states. After a given set of inputs, a state changes according to the state transition function.
Controlled data flow graphs
Controlled data flow graphs(CDFG)
Modeling by representing the controlled decision at the nodes and program paths(DFGs) that are traversed consequently from the nodes after the decisions.
Modeling by representing the controlled decision at the nodes and program paths(DFGs) that are traversed consequently from the nodes after the decisions.
Data Flow Graphs (DFG)
Data Flow Graphs (DFG)
The code for each process is represented by a circle and the data inputs to the process are from incoming arrows and generation of data output is through the outgoing arrow(s).
The code for each process is represented by a circle and the data inputs to the process are from incoming arrows and generation of data output is through the outgoing arrow(s).
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.
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.
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.
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.
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.
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.
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)..
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)..
Subscribe to:
Posts (Atom)