Though thy beginning was small, yet thy end will be very great.
This website is intended as a repository for details about UBC’s course EECE 320: Discrete Structures and Algorithms. The course will cover time (and space) complexity of algorithms and a few broad approaches to algorithm design. Towards this goal the course will also emphasize discrete mathematical objects (graphs and trees, in particular) and elementary proof techniques. The course will provide an introduction to some classic algorithms but – more importantly – the objective of the course is to promote problem solving skills and a deeper understanding of computation.