Difference between revisions of "CoE 164 S2 AY 2021-2022"
Carl Dizon (talk | contribs) |
Carl Dizon (talk | contribs) |
||
(5 intermediate revisions by the same user not shown) | |||
Line 9: | Line 9: | ||
'''Instructors''': | '''Instructors''': | ||
* Carl C. Dizon [carl.dizon at eeemail] | * Carl C. Dizon [carl.dizon at eeemail] | ||
− | * Daren Jay Quinio [] | + | * Daren Jay Quinio [daren.jay.quinio at eeemail] |
* Nestor Michael C. Tiglao [nestor at eeemail] | * Nestor Michael C. Tiglao [nestor at eeemail] | ||
'''Course Description''': This is an advanced laboratory course on the application of the concepts, methodologies, skills, and tradeoffs in designing/building computing systems to solve challenging problems, in an efficient and structured way.<br> | '''Course Description''': This is an advanced laboratory course on the application of the concepts, methodologies, skills, and tradeoffs in designing/building computing systems to solve challenging problems, in an efficient and structured way.<br> | ||
Line 17: | Line 17: | ||
'''Online Platforms''': UVLe, Piazza, Google Meet, Zoom, other quiz platforms, other code submission platforms. | '''Online Platforms''': UVLe, Piazza, Google Meet, Zoom, other quiz platforms, other code submission platforms. | ||
<br> | <br> | ||
− | '''Course Guidelines''': [[:File:Coe164 | + | '''Course Guidelines''': [[:File:Coe164 2122s2 Syllabus.pdf | <nowiki>[syllabus]</nowiki>]] [[:File:Coe164 2020s2 Completion Guidelines.pdf | <nowiki>[completion]</nowiki>]] |
<br> | <br> | ||
Line 77: | Line 77: | ||
| | | | ||
[https://app.tryeraser.com/workspace/M2L1WwH19IjDjJnYPCd3 <nowiki>[SE02][wb] Priority Heap and Binary Tree Traversal</nowiki>]<br> | [https://app.tryeraser.com/workspace/M2L1WwH19IjDjJnYPCd3 <nowiki>[SE02][wb] Priority Heap and Binary Tree Traversal</nowiki>]<br> | ||
− | [https://colab.research.google.com <nowiki>[SE02][oj] Online Judge</nowiki>] | + | [https://colab.research.google.com/drive/128v1NthdsOD7gU2TcOKlMoMEU90dLipg <nowiki>[SE02][oj] Online Judge</nowiki>] |
|- | |- | ||
| 8 | | 8 | ||
Line 87: | Line 87: | ||
| 10 | | 10 | ||
| | | | ||
− | | | + | | |
| | | | ||
|- | |- | ||
Line 97: | Line 97: | ||
| 12 | | 12 | ||
| | | | ||
+ | [SE03] A Faster Matrix Multiplication? | ||
| | | | ||
− | [ | + | [[:File:Coe164_2s2122_SE03.pdf | [SE03] Specifications]]<br> |
− | [ | + | [https://uvle.upd.edu.ph/mod/assign/view.php?id=239375 <nowiki>[SE03][bin] Submission Bin</nowiki>] |
| | | | ||
+ | [https://app.tryeraser.com/workspace/VhsEwVf4fZjhJMrPUNq1 <nowiki>[SE03][wb] Strassen Algorithm</nowiki>]<br> | ||
+ | [https://colab.research.google.com/drive/1awSR_PzvPk-DHwSsXyExq_8KP2KI7ygp <nowiki>[SE03][oj] Online Judge</nowiki>] | ||
|- | |- | ||
| 13 | | 13 | ||
Line 112: | Line 115: | ||
| 15 | | 15 | ||
| | | | ||
+ | [CP] Faster Flights With Barcodes | ||
| | | | ||
+ | [[:File:Coe164_2122s2_CP.pdf | [CP] Specifications]]<br> | ||
+ | [https://uvle.upd.edu.ph/mod/assign/view.php?id=245035 <nowiki>[CP][bin] Submission Bin</nowiki>] | ||
| | | | ||
+ | [https://app.tryeraser.com/workspace/EeMAz7xfWH6SYjZ3I3t3 <nowiki>[CP][wb] Reed-Solomon Error Correction + Barcode Decoding</nowiki>]<br> | ||
+ | [https://app.tryeraser.com/workspace/QjZWMVGNoFR7g6THJ2Ar <nowiki>[CP][wb] Finite Fields</nowiki>]<br> | ||
+ | [https://colab.research.google.com/drive/1PUYCuL1sxU3gEfEcw3ZS6kMnI9hxsfh_ <nowiki>[CP][oj] Online Judge</nowiki>] | ||
|- | |- | ||
| 16 | | 16 |
Latest revision as of 16:21, 27 May 2022
Course Information
Academic Period: 2nd Semester AY 2021-2022
Units: 3
Workload:
- 3 hours laboratory per week
Instructors:
- Carl C. Dizon [carl.dizon at eeemail]
- Daren Jay Quinio [daren.jay.quinio at eeemail]
- Nestor Michael C. Tiglao [nestor at eeemail]
Course Description: This is an advanced laboratory course on the application of the concepts, methodologies, skills, and tradeoffs in designing/building computing systems to solve challenging problems, in an efficient and structured way.
Synopsis: This course aims to 1) build and evaluate efficient computing platforms, 2) present algorithms, methods, and tools needed to solve challenging problems, and 3) practice sound engineering judgement in solving engineering problems.
Delivery Method: Digital materials and open-time laboratory sessions
Online Platforms: UVLe, Piazza, Google Meet, Zoom, other quiz platforms, other code submission platforms.
Course Guidelines: [syllabus] [completion]
Course Outline
Week | Topics | Academic Requirements | Resource Links |
---|---|---|---|
0 |
|
||
1 | |||
2 | |||
3 | |||
4 |
[SE01] Run-length message decoding |
||
5 | |||
6 | |||
7 |
[SE02] Website Priority Queueing |
[SE02][wb] Priority Heap and Binary Tree Traversal | |
8 | READING BREAK
| ||
9 | LENTEN BREAK
| ||
10 | |||
11 | |||
12 |
[SE03] A Faster Matrix Multiplication? |
||
13 | |||
14 | READING BREAK
| ||
15 |
[CP] Faster Flights With Barcodes |
[CP][wb] Reed-Solomon Error Correction + Barcode Decoding | |
16 | |||
17 |
Grading Rubric
60% Software exercises
40% Software projects