CoE 163 S2 AY 2022-2023
Course Information
Academic Period: 2nd Semester AY 2022-2023
Units: 3
Workload:
- 3 hours lecture per week
- 1-2 hours exercise per week
Instructors:
- Isabel M. Austria [isabel.austria at eeemail]
- Carl C. Dizon [carl.dizon 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, Google Meet, Zoom, other quiz platforms.
Course Outline
Week | Topics | Academic Requirements | Resource Links |
---|---|---|---|
0 |
[00] Course overview and synopsis |
||
1 |
[01a] Review of CS data structures and algorithms |
||
2 |
[02a] Review of asymptotic analysis |
||
3 |
[03a] Choosing a platform |
[[ | [03a slides]]] | |
4 |
[04a] Review of linear algebra operations |
||
5 |
[05a] Cache behavior of linear algebra operations |
||
6 | LENTEN BREAK
|
||
7 | READING BREAK
|
||
8 |
[06a] BLAS and ATLAS |
||
9 |
[10a] Gaussian elimination |
||
10 |
[11a] Parallel computing introduction |
||
11 |
[12x] Parallel programming algorithms |
||
12 |
[13a] GPU programming basics |
||
13 | |||
14 | |||
15 | |||
16 |
Finals week |
||
17 |
Finals week |
Grading Rubric
32% Short quizzes
48% Software exercises
20% Capstone exercise