ALGORITHM AND COMPLEXITY Flashcards
4 guide in AL
- input and output specification
- algorithm and data structure design
- complexity analysis
- program testing and debugging
- input and output specification means
programmer should know what will be the input to the program and what the exact information should be in the output
- algorithm and data structure design means
algorithm is finite sequence of instructions that can performed in a finite length of time
data structure is a way to organize data collection of variables in different data type
what is data type
data type refers of the data that a variable may hold in
example
variable type int or string
what is pseudo language
language that use to represent algorithms combination of english statements and the construct of programming language
which is more important data structure or algorithm
both data structure and algorithm is important
cause algorithm may depend on how data stored and data structure depends on how we want to manipulate data
- Complexity analysis means
analyze the time and space of the algorithm to ensure complexity of the algorithm
- program testing and debugging
debugging should not be the consuming time if you design your algorithm and data structure carefully but your program needed to debug because human are not perfect
criteria for algorithm to be satisfy
- input and output
- definiteness
- finiteness
- effectiveness
input and output meaning
input an algorithm may have zero or kore quantities in algorithm minimum of zero input are accepted
output the data items resulting from the execution of an algorithm there should be one quantity
definiteness means
each instruction must be precise or clearly define
finiteness means
trace out the instructions of an algorithm will terminates after a finite number
effectiveness means
effectiveness will be measured once algorithm is performed what it is supposed to do
a computer cannot perform an instruction if it has lack of information
