This course includes COMP1100 and extends it with 12 one-hour lecture/tutorial/laboratory sessions. It introduces students to various areas of research in computer science, especially those research areas represented in the School of Computer Science. A number of research groups in the School will be responsible for various parts of the course. Each part will consist of some introductory lectures on the data structures and algorithms most relevant to the research area and an overview lecture on the research problems, techniques, and applications of the area. Specific technical material to be covered includes lists, trees, induction, recursion, the Big-Oh notation, and the running time of programs.

Upon completion of this course, in addition to the learning outcomes of COMP1100, the student will be able to:

• Understand proof by induction, recursion, the running time of programs, and the Big-Oh notation.
• Understand various data structures including lists and trees and their associated algorithms, and be able to appropriately use these data structures in programs.
• Understand how data structures and algorithms are employed in various research areas in computer science.
• Have some appreciation of current issues in computer science research.

Assignments (40%); Final exam (60%)

Forty two one-hour lectures, ten two-hour tutorial/laboratory sessions.

Enrolment in the Bachelor of Advanced Computing, or permission from the Head of Computer Science.

Aho, Alfred V. & Ullman Jeffrey D. Foundations of Computer Science, C Edition, 1995.