Difference between revisions of "CoE 163 S2 AY 2020-2021"
Jump to navigation
Jump to search
Carl Dizon (talk | contribs) m |
Carl Dizon (talk | contribs) m |
||
| Line 78: | Line 78: | ||
* [04a] Review of linear algebra operations | * [04a] Review of linear algebra operations | ||
* [04b] Solving problems using linear algebra | * [04b] Solving problems using linear algebra | ||
| − | * [04c] | + | * [04c] Considerations on formulating linear algebra algorithms |
|| | || | ||
|| | || | ||
| Line 87: | Line 87: | ||
| 5 | | 5 | ||
|| | || | ||
| − | * | + | * [05a] Cache review |
| − | * | + | * [05b] Matrix-matrix multiplication part 01 |
| + | * [05c] Matrix-matrix multiplication part 02 | ||
|| | || | ||
|| | || | ||
Revision as of 20:47, 7 May 2021
Course Information
Academic Period: 2nd Semester AY 2020-2021
Units: 3
Workload:
- 3 hours lecture per week
- 1-2 hours exercise per week
Instructors:
- Carl C. Dizon [carl.dizon at eeemail]
- Isabel M. Austria [isabel.austria at eeemail]
- Nestor Michael C. Tiglao [nestor at eeemail]
Synopsis: This course aims to 1) present the connection between algorithms, implementation, and computer architecture, 2) provide tools needed to write and apply fast numerical code, and 3) present representative fundamental numerical algorithms.
Delivery Method: Video lectures and digital materials
Online Platforms: UVLe, Piazza, edX, Google Meet, Zoom, other quiz platforms.
Course Outline
| Week | Topics | Academic Requirements | Resource Links |
|---|---|---|---|
| 0 |
|
||
| 1 |
|
[SQ01] CS problems |
|
| 2 |
|
[SQ02] Asymptotic analysis |
[02a slides] |
| 3 |
|
[03a slides] | |
| 4 |
|
||
| 5 |
|
||
| 6 |
|
|
|
| 7 |
|
|
|
| 8 |
|
|
|
| 9 |
|
|
|
| 10 |
|
|
|
| 11 |
|
|
|
| 12 |
|
Grading Rubric
40% Short quizzes
35% Machine exercises
25% Capstone exercise
