A set of rules to be followed during calculations or other problem solving operations is what defines algorithm. Computational complexity for instance defines clearly the major concern of algorithm, which is efficiency, which involves how much time and memory required to solve problem. Bt0080 - Fundamentals of algorithms will help you understand what algorithm is all about.
Sequence of activities
Step-by step procedure
Flow of information
Both b and c
Definiteness
Finiteness
Correctness
Effectiveness
Direct sequencing
Indirect sequencing
Direct selection
Indirect selection
Strictly monotonically increasing function
Monotonically decreasing function
Strictly monotonically decreasing function
Mod function
Ceiling function
Floor Function
Monotonically increasing function
Exponentiation Function
Exponential
Floor Function
Ceiling function
Monotonically increasing function
A
B
C
D
Divide and conquer
Decrease and conquer
Space and time tradeoff
Greedy method
[1:n]
[2n:n]
[1:2n]
[2:n]
Optimal solution
Local solution
Exact solution
Correct solution correct solution correct solution
Divide and conquer technique
Greedy technique
Decrease and conquer technique
Time and space tradeoff
When the shortest path to the destination vertex is found
When all the vertices in the graph are included to the path
When the vertices together form a cycle
When the minimum spanning tree is constructed
Backward approach
Forward approach
Top down approach
Bottoms up approach
Undirected graph
Directed graph
Directed as well as undirected graph
Type of tree
Matrix A
Array A
Graph A
Tree A
8-tuples (x1…… x8),
12-tuples (x1…… x12),
16-tuples (x1…… x16),
4-tuples (x1…… x4),
3.34%
2.34%
1%
4.34%
Systematically
Logically
Periodically
Non- systematically
FIFO
LIFO
LILO
FILO
FIFO
LIFO
FILO
LILO
State space tree
Binary search tree
Syntax tree
Flowchart
Lower bound
Upper bound
Space complexity
Average bound
Descendent
Identical
Differ
Local
Comparison
Differentiation
Multiplication
Division
Self-loop
Open loop
Closed vertex
Open vertex Open vertex Open vertex
Wait!
Here's an interesting quiz for you.