This preview shows pages 1–3. Sign up to view the full content.
Algorithms
&
AI
0. An algorithm is a stepbystep list of instructions for solving
a particular problem, that has a definite starting and
stopping point.
1.
Problem Solving with Computers
0. Continuous
Analog
1. Discrete
Digital
Algorithms
0. Algorithms are independent of the computer
language used.
1. They are the underlying set of steps that can be
turned into a software routine.
Which Algorithm?
2. Choosing the Right Algorithm …
0. The precision of the desired answer
1. The runtime
2. The availability of system resources, such as
memory, processor type, etc…
Complexity
3. Computer science algorithms are categorized by
complexity.
4. P type  Polynomial Time
3. Less complex
5. NP type  Non Polynomial Time
4. Very complex
This preview has intentionally blurred sections. Sign up to view the full version.
View Full DocumentProcessing Power
2. Serial Processing
0. One instruction after another.
3. Parallel Processing
5. SIMD: Single Instruction Multiple Data
6. MIMD: Multiple Instruction Multiple Data
Algorithms
4. The human brain contains about 100 billion neurons. With
all the parallel connections that can be formed, we have
about 10,000 teraflops of computing power in our brains.
This is the end of the preview. Sign up
to
access the rest of the document.
 Spring '08
 dino

Click to edit the document details