This course includes COMP1110 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, other than those covered in COMP1130. 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. These topics will include graphs, sets, probability and propositional logic.

Upon completion of this course, in addition to the learning outcomes of COMP1110, the student will be able to further the following outcomes from COMP1130:

• Understand how probability and/or propositional logic can be applied to computer science problems.
• Understand various data structures, including graphs, 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.

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