Limitations of Computing Flashcards
What is precision?
The maximum number of significant digits that can be represented.
What are error-detecting codes?
Techniques to determine if an error has occurred during data transmission and then alert the system.
What are error-correcting codes?
Error codes that detects an error has occurred and makes an attempt to correct it.
What is parity bit?
An extra piece of information that indicates whether a piece of information is correct or not and whether it needs to be changed.
What is an odd parity?
It requires the number of 1s in a byte including the parity bit to be odd.
What is an even parity?
It requires the number of 1s in a byte including the parity bit to be even.
When does the parity bit fail?
When there’s more than one error.
It does not show the user how to correct the data it only allows a request of re-submission.
What is check digit?
A scheme that sums the individual digits of a number and store the unit digit with the message.
What is higher-dimensional parity-check?
For a one-dimensional message we can locate an occurrence of a single error by converting it into a two-dimensional format. For an n-dimensional parity check we can only detect and correct up to n/2 errors.
What are the four stages of computer problem solving?
- Writing the problem
- Develop the algorithm
- Implement the algorithm
- Maintain the algorithm
What are the two ways of comparing algorithmic complexity?
- Time Complexity
- Space Complexity
What is time complexity?
The amount of time an algorithm will take to run given certain inputs.
What is space complexity?
The amount of space an algorithm will require to process the given inputs.
What is Big-O notation?
A notation that expresses computing complexity as the term in a function that increases most rapidly, relative to the size of a problem.
