February 2008 - Posts
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...
Just came back to office after UIT2201 Group 2 tutorial and the ensuing discussion with students on projects. Then got SMS from my daughter that to tell me that Singapore WON the YOG bid! Logged in to watch CNA online and saw PM's speech after that. There
Read More...
To all in UIT2201: I am enjoying my UIT2201 class very much this semester, and a lot of it has to do with you -- all of the students in the class -- contributing ideas, comments, suggestions and all that. It motivated me to bring back something that I
Read More...
Hi to all: Since many of you asked/emailed me about this project and you want to discuss different things or look for partners, etc -- I am creating this post so that you can have a place to discuss them and also to look for team members, and so on. For
Read More...
To all in UIT2201: This blog has been active. But, spam has started to invade our blog because I have allowed anonymous comments. It is an irritation that I do not need nor have time for. So, I have turned off anonymous comments to try to block (most
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...
Tutorial 4: 14-Feb-2008; (quick, personal summary) In Tutorial 4, D1 is a "thinking problem" (in an earlier comment, Hung said that he likes them), D2 aims to clearly demonstrate the reason for focussing on "rate of growth" of functions, and why we can
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...
copied from IVLE email to all of you... To all in UIT2201: As discussed in class, I am trying to move Quiz 1 from 21-Feb to 06-Mar (both dates are Thu and quiz will be 7-8pm). This is in response to several request and also to give people time to revise
Read More...
Lecture 4: (quick, personal summary) In lecture 4, I talked a little about project (yes, I put up a project page with some basic project info), about this module blog, and about timing of Quiz 1. I covered the rest of Algorithm Problem Solving (largest,
Read More...
Tutorial 3: (quick, personal summary) In Tutorial 3, my aims were (1) to encourage learning algorithms by designing them. We have D1 that extends the idea of swapping two variables. I use this problem to discuss generalizing it to "create holes" when
Read More...
Lecture 3: (quick, personal summary) In lecture 3, we finally get to talk about algorithms -- the primitives, with examples. We also covered simple algorithms (sum), the basic structure of an iterative loop, and a simple sequential search -- but I did
Read More...