2008/2009 Semester 1
If you have any doubts on the questions, feel free to contact me: chenyu@comp.nus.edu.sg
I will be in ACM Lab(SoC1-619, Tel:6516 6998) for most of the time, please kindly make an appointment(drop me an E-mail or call me) if you want some consultation.
We will have the 1st discussion from 10-12am on 25 Aug. Please review the previous lecture notes. It is strongly recommended you try out the examples in the textbook for yourself.
Problem of b^n: Iteration vs Recursion
Try to challenge yourself and implement your own algorithm!
For those who cannot really understand:
Algorithm 1: a^8= a^7*a = a^6*a*a=...=a*a*a*a..*a; 8 steps
Algorithm 2: a^8= (a^4)*(a^4) = (a^2*a^2)*(a^4)=...; expand it, 3 steps
Then you may try use mathematical induction to prove the complexity.
You should be able to develop an efficient algorithm and test it for yourself. Reminder: Practical Exam is approaching. Try more past year question to get acquainted with the problems.Useful Links:
Introduction to Course Marker Client
SSH Shell Client 3.2.9 Download
USACO is for those who like challenging problems.
I use LaTeX to typeset my slides for tutorials. It gives you a good organization for the presentation.
It gives you more freedom to configure your Linux. Just try it out!