start
Differences
This shows you the differences between two versions of the page.
| Both sides previous revisionPrevious revisionNext revision | Previous revision | ||
| start [2015/08/31 15:33] – jxu | start [2021/01/15 20:09] (current) – jxu | ||
|---|---|---|---|
| Line 1: | Line 1: | ||
| ~~NOTOC~~ | ~~NOTOC~~ | ||
| - | ====== | + | ====== |
| ===== Description | ===== Description | ||
| - | This course | + | This course |
| + | in the design | ||
| + | the classical data structures, and master the use of abstraction, | ||
| + | specification and program construction using modules. Furthermore, | ||
| + | students | ||
| + | implementation of algorithms | ||
| + | |||
| + | Learning Outcomes | ||
| + | |||
| + | * Instantiate a range of standard abstract data types (ADT) as data structures | ||
| + | * Implement these data structures | ||
| + | * Apply best practice software engineering principles in the design | ||
| + | * 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 ===== | ===== Lecture Times ===== | ||
| - | * Section | + | * Section |
start.1441035229.txt.gz · Last modified: by jxu
