Dear ...Student:

  Thank you for the interest in the course.
  To answer your queries -- 

A Student writes:
|>
|>Hi Dr Leong,
|>
|>With regard to the above master course, I will appreciate your help in the
|>following questions:
|>

|>1. Will the course place a lot of emphasis on the mathematical proof and
|>analysis of graph algorithms?  

   Yes! As mentioned in my intro and again in my first lecture,
   we will place a lot of emphasis on detailed analysis -- 
   and, of ocurse, mathematical proofs on the performance of graph
   and other algorithms in this course. 
     
   So, there is quite a bit of proofs in the lectures and
   in the homeworks.

   This is quite unavoidable if we want to tackle any advanced analysis 
   of algorithms and push for performance. 


|>2. May I know to what level of mathematical proficiency is required for
|>taking this course?
|>
   This part is a little harder to make precise. Analysis of
   algorithms generally require largely discrete mathematics skills
   similar to that covered in our CS1301 Discrete Mathematics.

   The kind of analysis of algorithm that I assume will be those
   typically covered in a data structures and algorithms course
   such as our IC2101. To get an idea of the kind of analysis that 
   is assumed, take a look at the book 

     M. A. Weiss, 
     Data Structures and Algorithm Analysis, Benjamin Cummings, 1992.

     or 

     G. Brassard and P. Bradley,
     Algorithmics: Theory and Practice, Prentice Hall, (1988).

   and see some of the algorithm analysis there -- eg analysis of
   quicksort and heapsort, BFS, DFS, shortest paths, MST.
   You should be able to follow the analysis of these algorithsm
   given in the book.


|>3. I am interested in taking the course but my background in algorithm
|>analysis and data structure is not strong.  Could you recommend books that
|>will help me to  brush up on backgound knowledge for this course?
|>
   See above -- Weiss, in particular about some of background
   necessary.

Regards, Dr Leong (24-7-1998)