Differences

This shows you the differences between two versions of the page.

--- start [2017/09/05 21:24] – jxu
+++ start [2019/09/03 14:50] (current) – jxu
@@ Line 11: / Line 11: @@
 implementation of algorithms
+Learning Outcomes for the course
+  * Instantiate a range of standard abstract data types (ADT) as data  structures
+  * Implement these data structures and associated operations and  check that they satisfy the properties of the ADT
+  * Apply best practice software engineering principles in the design  of new data structures
+  * Demonstrate the ability to reason about data structures using  contracts, assertions, and invariants
+  * Analyse the asymptotic run times of  standard operations for a  broad range of common data structures
+  * Select the most appropriate data structures for novel applications.
+Prerequisites:
+General prerequisites;
+LE/EECS1030 3.00 or LE/EECS2030 3.00; LE/EECS1028 3.00 or SC/MATH1028 3.00 or
+LE/EECS1019 3.00 or SC/MATH1019 3.00
 ===== Lecture Times =====
-  * Section A: Tuesdays and Thursdays, 14:30 - 16:00, FC 203.
+  * Section E: Tuesdays and Thursdays, 9:30 - 11:00, CLH G.