I was working on a list of algorithms a new college graduate ought to know to either
Here is the list I have so far, I would appreciate comments on what else to add
- Do well in an interview
- Make quick progress through the learning curve
Here is the list I have so far, I would appreciate comments on what else to add
- Population Counting
- Multi-precision Arithmetic
- Fast Fourier Transform
- Fast Prime Number Generation
- Quicksort
- Union-Find
- String searching (KMP, Regular Expressions)
- Polynomial Multiplication
- Calculation of Pi
- 8 Queens Problem
- Instance of a turing machine simulation
- Tries
- Radix Tree
- Red Black Tree
- Huffman's algorithm
- Graphs - DFS, BFS
- Graphs - Bipartite
- Minimum Spanning Tree
- Hashing algorithms
- Linear programming?
- Classes of problems - P/NP/?
- Vertex Cover?
- Synchronization (locks/mutex/spin locks)
- Lockless algorithms
1 comment:
Hmm.. I wonder if I should focus on conversations with a system programmer with some tips on what a system programmer should know!
Examples
Calling conventions
ABI
Math in the processor
Linking/Loading
and more...
Post a Comment