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 12: | Line 12: | ||
'''Instructors''': | '''Instructors''': | ||
* Carl C. Dizon [carl.dizon at eeemail] | * Carl C. Dizon [carl.dizon at eeemail] | ||
− | * Isabel | + | * Isabel M. Austria [isabel.austria at eeemail] |
* Nestor Michael C. Tiglao [nestor 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. | '''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. |
Revision as of 19:22, 16 April 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, Google Meet, Zoom, other quiz platforms.
Course Outline
Week | Topics | Expected Academic Requirements | Resource Links |
---|---|---|---|
0 |
|
||
1 |
|
|
|
2 |
|
|
|
3 |
|
|
[03a slides] |
4 |
|
|
|
5 |
|
|
|
6 |
|
|
|
7 |
|
|
|
8 |
|
|
|
9 |
|
|
|
10 |
|
|
|
11 |
|
|
|
12 |
|
Grading Rubric
25% Short quizzes
50% Machine exercises
25% Capstone exercise