CA622: Advanced Algorithms

1
CA622 Advanced Algorithms

• This module examines a variety of algorithms and
  data structures from an advanced viewpoint.
• Emphasis is placed on understanding the relative
  merits of different approaches, and on being able
  to choose the most appropriate data structure and
  algorithm. Various design methods are
  investigated in that context.
• A variety of problem types are examined,
  including internal and external searching,
  sorting, string processing, and graph traversal.
• The time and space complexity of the algorithms
  is estimated, but detailed mathematical analysis
  is restricted to the simpler cases.
• An introduction is given to complexity theory and
  NP completeness.
• CA622 is structured as 2 lecture hours per week.
• Assessment is based on a final examination (70)
  and continuous assessment (30)

2
Bibliography and References

• Various papers will be handed out. The following
  books are useful references, in particular the
  Berman and Paul book. Anyone with a real interest
  in algorithms should invest in Knuths three
  volumes.
• Algorithms Sequential, Parallel and
  Distributed, K.A.Berman, J.L.Paul Thomson 2005
• Introduction to Algorithms, T.H. Cormen, C.E.
  Leiserson, R.L.Rivest The MIT Press 2001
• Algorithms in C (or Java, if you prefer),
  R.Sedgewick Addison-Wesley 1998
• Data Structures and Algorithms, Aho, Hopcroft,
  Ullman Addison-Wesley 1983
• The Art of Computer Programming Vols 1,2,3,
  D.E. Knuth Addison-Wesley 1997-98
• Analysis of Algorithms, R.Sedgewick,
  P.Flajolet Addison-Wesley 1996
• Handbook of Algorithms and Data Structures,
  G.Gonnet, R.Baeza-Yates Addison-Wesley 1991
• Programming Pearls, J.L. Bentley Addison-Wesl
  ey 1999