Browse by Tags
All Tags »
Efficiency (RSS)
About Recursion Recursion is a central idea in computer science and in almost all of the sciences. While I did not cover recursive algorithms in UIT2201 this semester (too many things to do, not enough time to do everything), I cover the ideas of recursion
Read More...
Tutorial 5: 21-Feb-2008; (quick, personal summary) Tutorial 5 is all about databases and query processing. I use it to illustrate the difference between declarative query (like SQL) and procedural query (as done via e-project, e-select, and e-join). Declarative
Read More...
Lecture 6: (quick, personal summary) In lecture 6, I wanted to start and finish covering Databases, but because we discussed the course project quite a bit, I could not finish everything I wanted to. Ended up having to finish the last 10 minutes during
Read More...
About the Partition Problem (T4-D1) The partition problem (T4-D1) is an example of a thinking problem. You are given a simple statement of the problem and you are asked to find an algorithm for solving the problem. In class, several methods were given
Read More...
Lecture 5: (quick, personal summary) In lecture 5, I finished up on efficiency of algorithms -- re-iterated the idea of analyzing the dominant operation using the theta-notations. Then covered efficiency analysis of Pattern-Match algorithm, introduced
Read More...