Note: Also look at Review Sheets 1 and 2.
Points:
q Shortest
path algorithm
q BFS/DFS,
queues
q Spanning
& binary trees
q Sum,
product and division rules
q Permutations
& combinations
q Combinatorial
theorems and arguments
q Binomial
theorem
q Balls
and Urns: distinguishable and indistinguishable
q Inclusion/exclusion
q Pigeonhole
principle
Sampler:
q
For
the given graph find (a) length of the shortest path and (b) state the path
found.
q
For
a given graph, use DFS to find a spanning tree.
q
Do postorder traversal of the given binary tree.
q
In
how many ways you can rearrange letters of a word, given some restrictions.
q
How
many triangles can you form using diagonal chords of an n-gon,
subject to some given conditions.
q
Expand
(x-2y)5 using binomial theorem.
q
Prove
a given equation by combinatorial arguments or by using algebra.
q State a given
problem as a balls and urns problem and solve it (ex: 4.7 10.a)
q
Solve
an inclusion-exclusion problem (ex. 4.8 3c)