algorithms Exam
topics :
- algorithms course :
- Data structures (hashes, trees, linked structures, heaps, etc.)
- classic problem spaces : sorting, graphs, combinatorics (traveling salesman, quicksort, ...)
- O() ideas, arguments about why X (i.e. Dijkstra's minimal spanning tree) has Y behavior & numerical experimentation with plotting
- P vs NP , NP complete concepts & examples
- information theory course
- definition and code to calculate entropy from (say) big text file
- compression algorithms: huffman & lzw , concepts & implementation
- AI class
- searching (depth vs breadth & stacks vs queues)
