| Abstract: |
Main course goal,
design of fast algorithm,
prerequisites,
approach,
analytical,
build a mathematical,
model of a computer,
Random access machine,
Instruction set,
Outline,
RAM vs. Real computers,
General strategy,
Examples,
Summary,
Real computers,
Main memory location,
Complier intelligence,
General analysis strategy,
Conservation,
Functional form,
Matrix multiplication,
RAM model,
Analysis strategy ,
Worst case analysis,
overview,
basic frame work,
graph theory,
NP completeness theory,
Euclid,
Simple factoring algorithm,
Proof of correctness of Euclid,
Conclusion ,
Basic idea,
Outline,
Formal definition,
Informal definition,
Mathematical model,
Analysis strategy,
Algorithm and their analysis,
Discussion of limitation,
Problem,
Finding a shortest path,
Finding a word in a dictionary,
Input instance,
Algorithm,
Computational procedure,
Mathematical model of a computer
Random access machine(RAM),
Collection of location,
How to design algorithm for RAM,
Primitive data types,
Instruction set of the processor,
Arithmetic and logical operation,
Jumps and conditions jumps,
Pointer instruction,
More complex algorithm statements,
Function calls,
Relation to reality,
Algorithm analysis
|
Electronics & Communication Engineering
Design and Analysis of Algorithms
