Algorithmen und Datenstrukturen für Chemie und Bioinformatik
General Topics:
- Brief Introduction to Computer Science
- What is an Algorithm
- Greatest Common Divisor (Euclid's Algorithm)
- What is an Abstract Data Type (ADT)
- Analyzing Algorithms (runtime complexity, big-O notation ...)
- Insertion Sort
- Prime Number Sieve of Eratosthenes
- NP-Completeness
- Turing Machine
- Complexity Classes
- NP-Completeness Proofs
- Satisfiability Problem (SAT)
- Vertex Cover Problem
- Hamiltonian Cycle Problem
- Sorting Algorithms
- ADT List
- Hash Tables
- ADT Tree
- Heaps
- Basic Graph Algorithms
- Spanning Trees
- Breadth-First-Search
- Depth-First-Search
- Topological Sorting
- Shortest Paths
- Search Trees
- AVL-Trees
- Red-Black Trees
- Tries
- B-Trees
- String Algorithms
- Greegy Algorithms
- Active-Selection Problem
- Huffman codes
Christoph Flamm
<xtof@tbi.univie.ac.at>
Last modified: 2004-09-24 11:17:50 xtof