About this document
RAM Model of Computation Explained by Nway Nway Wint Aung is a document available to read on EtoBox.
The document discusses algorithms and their complexity. It defines an algorithm as a design for a computer program. The time and space complexity of an algorithm is expressed as a function of the problem size and the limiting behavior as size increases is the asymptotic complexity. Random access machines are introduced as a model of computation that consists of input/output tapes and memory registers. The computational complexity of RAM programs is analyzed based on uniform and logarithmic cost criteria. A
- Author
- Nway Nway Wint Aung
- Language
- EN