Yes, and in ways I would not expect. AP is perfect to use to quickly convert urls to clickable ones ;p And if you ask, yes, this is what I need to know for tomorrow... x]

1. Algorithms complexity.
http://en.wikipedia.org/wiki/Computational_complexity_theory

2. Algorithm design paradigms
http://www.csc.liv.ac.uk/~ped/teachadmin/algor/algor.html

http://en.wikipedia.org/wiki/Divide_and_conquer_algorithm
http://en.wikipedia.org/wiki/Dynamic_programming
http://en.wikipedia.org/wiki/Greedy_algorithm
http://en.wikipedia.org/wiki/Backtracking

3. Basic data structures.
a) list, queue
b) heap
c) priority queue

4. Trees
a) binary trees
b) balanced trees (AVL)
c) B-trees
http://en.wikipedia.org/wiki/Binary_tree
http://en.wikipedia.org/wiki/AVL_tree
http://en.wikipedia.org/wiki/B-tree

5. Sorting algorithms.
http://en.wikipedia.org/wiki/Sorting_algorithm

6. Searching algorithms.
http://en.wikipedia.org/wiki/Search_algorithm

7. Graph theory, colouring problem.
http://en.wikipedia.org/wiki/Graph_theory

8. Minimum spanning tree, greedy algorithms.
http://en.wikipedia.org/wiki/Minimum_spanning_tree
http://en.wikipedia.org/wiki/Greedy_algorithm

9. Euler circuits and paths vs. Hamiltonian cycles and paths.
http://planetmath.org/encyclopedia/EulerCircuit.html
http://planetmath.org/encyclopedia/EulerPath.html
http://en.wikipedia.org/wiki/Hamiltonian_path

10. Route problems, shortest path.
http://en.wikipedia.org/wiki/Shortest_path_problem

11. Flows in networks.
http://en.wikipedia.org/wiki/Net_flow

12. Deterministic and nondeterministic Turing machine.

13. Regular expressions, finite automata, regular languages.

14. Context free grammars, pushdown automata, context free languages

15. Nondeterministic finite automata.

16. Chomsky hierarchy.

17. Methods of processing synchronizations
http://en.wikipedia.org/wiki/Synchronization_(computer_science)
a) deadlock, starving
http://en.wikipedia.org/wiki/Deadlock
http://en.wikipedia.org/wiki/Resource_starvation

18. Interpolation and its applications.
http://en.wikipedia.org/wiki/Interpolation

19. Solving linear equations and sets of equations.
http://acm.uva.es/p/v101/10109.html

20. Solving non-linear equations and sets of equations, locating roots of equations ??
http://www.purplemath.com/modules/syseqgen.htm

21. Numerical integration methods.
http://en.wikipedia.org/wiki/Numerical_integration

22. Differences between high-level languages and assemblers.
http://en.wikipedia.org/wiki/High-level_programming_language
http://en.wikipedia.org/wiki/Assembly_language
http://en.wikipedia.org/wiki/Machine_language

23. Interpretation vs. compilation.
http://en.wikipedia.org/wiki/Interpreter_(computing)
http://en.wikipedia.org/wiki/Compilation_(programming)

24. Properties of object-oriented programming.
http://en.wikipedia.org/wiki/Object-oriented_programming

25. Colour models.
http://www.mini.pw.edu.pl/~kotowski/Grafika/Wyklady.htm

26. Illumination models.
http://www.mini.pw.edu.pl/~kotowski/Grafika/Wyklady.htm

27. Raster algorithms for line drawing. Aliasing and Antialiasing.
http://www.mini.pw.edu.pl/~kotowski/Grafika/Wyklady.htm

28. Spline functions.
http://en.wikipedia.org/wiki/Spline_(mathematics)

29. Algorithms of filling the area.
http://www.mini.pw.edu.pl/~kotowski/Grafika/Wyklady.htm

30. Visible surface determination.
http://www.mini.pw.edu.pl/~kotowski/Grafika/Wyklady.htm

31. Image filtering.
http://www.mini.pw.edu.pl/~kotowski/Grafika/Wyklady.htm

32. Relative databases.
a) normal forms
b) data structures

33. What is UML?
http://www.mini.pw.edu.pl/~kaczmars/pion/lectures.html

34. Software developing models.
http://www.mini.pw.edu.pl/~kaczmars/pion/lectures.html

35. Goals and methods of software testing.
http://www.mini.pw.edu.pl/~kaczmars/pion/lectures.html

36. Heuristic search methods.
http://cogsci.ucsd.edu/~batali/108b/lectures/heuristic.html