Difference between revisions of "CoE 164 S2 AY 2021-2022"

From Microlab Classes
Jump to navigation Jump to search
(Initial creation of page)
 
 
(8 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 2020s2 Syllabus.pdf | <nowiki>[syllabus]</nowiki>]] [[:File:Coe164 2020s2 Completion Guidelines.pdf | <nowiki>[completion]</nowiki>]]
+
'''Course Guidelines''': [[:File:Coe164 2122s2 Syllabus.pdf | <nowiki>[syllabus]</nowiki>]] [[:File:Coe164 2020s2 Completion Guidelines.pdf | <nowiki>[completion]</nowiki>]]
 
<br>
 
<br>
  
Line 27: Line 27:
 
|-
 
|-
 
| 0
 
| 0
||  
+
|
 
* Course overview and synopsis
 
* Course overview and synopsis
 
* Course requirements
 
* Course requirements
||
+
|
||  
+
|
 
[[:File:Coe164_2020s2_00_about.pdf | [slides]]]<br>
 
[[:File:Coe164_2020s2_00_about.pdf | [slides]]]<br>
 
[[:File:Coe164_2020s2_Syllabus.pdf | [syllabus]]]
 
[[:File:Coe164_2020s2_Syllabus.pdf | [syllabus]]]
Line 37: Line 37:
 
| 1
 
| 1
 
|
 
|
* Claude Shannon
+
|
||
+
|
||
 
[https://www.youtube.com/watch?v=z2Whj_nL-x8 <nowiki>[video] Claude Shannon - Father of the Information Age</nowiki>]
 
 
|-
 
|-
 
| 2
 
| 2
||
+
|
||
+
|
||
+
|
 
|-
 
|-
 
| 3
 
| 3
||
+
|
||
+
|
||
+
|
 
|-
 
|-
 
| 4
 
| 4
||
+
|
||
+
[SE01] Run-length message decoding
||
+
|
 +
[[:File:Coe164_2s2122_SE01.pdf | [SE01] Specifications]]<br>
 +
[https://uvle.upd.edu.ph/mod/assign/view.php?id=194628 <nowiki>[SE01][bin] Submission Bin</nowiki>]
 +
|
 +
[https://colab.research.google.com/drive/1S1KwtHzOcVg-hHcC8QqE26z6Bhn4M-03 <nowiki>[SE01][oj] Online Judge</nowiki>]
 
|-
 
|-
 
| 5
 
| 5
||
+
|  
||
+
|
||
+
|
 
|-
 
|-
 
| 6
 
| 6
||
+
|
||
+
|
||
+
|
 
|-
 
|-
 
| 7
 
| 7
||
+
|
||
+
[SE02] Website Priority Queueing
||
+
|
 +
[[:File:Coe164_2s2122_SE02.pdf | [SE02] Specifications]]<br>
 +
[https://uvle.upd.edu.ph/mod/assign/view.php?id=228454 <nowiki>[SE02][bin] Submission Bin</nowiki>]
 +
|
 +
[https://app.tryeraser.com/workspace/M2L1WwH19IjDjJnYPCd3 <nowiki>[SE02][wb] Priority Heap and Binary Tree Traversal</nowiki>]<br>
 +
[https://colab.research.google.com/drive/128v1NthdsOD7gU2TcOKlMoMEU90dLipg <nowiki>[SE02][oj] Online Judge</nowiki>]
 
|-
 
|-
 
| 8
 
| 8
||
+
| colspan="3" | <div style="text-align: center;">'''READING BREAK'''</div>
||
 
||
 
 
|-
 
|-
 
| 9
 
| 9
||
+
| colspan="3" | <div style="text-align: center;">'''LENTEN BREAK'''</div>
||
 
||
 
 
|-
 
|-
 
| 10
 
| 10
||
+
|
* [MP01] Make your 2D matrix barcode more robust!
+
|
||
+
|
[[:File:Coe164_2020s2_MP01.pdf | [MP01] Specifications]]<br>
 
[https://docs.google.com/forms/d/e/1FAIpQLSfbLCDj52EznOgOfy4x5Iwxtox5EAiSDMcbNGEhPjk4Gyafzw/viewform <nowiki>[MP01][bin] Submission Bin</nowiki>]
 
||
 
[https://app.tryeraser.com/workspace/EqvVEN882XZtW7heKMKO <nowiki>[MP01][wb] Finite Fields</nowiki>]<br>
 
[https://app.tryeraser.com/workspace/7b9JBTVt238JLYmoW0aP <nowiki>[MP01][wb] Reed-Solomon ECC Encoding</nowiki>]<br>
 
[https://pastebin.com/tXwKru1X <nowiki>[MP01][note] Notes</nowiki>] - PW: notes_barcode<br>
 
[https://colab.research.google.com/drive/1z5Kx4waivgrRdEC5c_rzxoFpCZ4GSUMK <nowiki>[MP01][oj] Online Judge</nowiki>]<br>
 
[https://colab.research.google.com/drive/12k3tl9ppnHv-AqW_NPwDtW1jA7wudt6x <nowiki>[MP01][ans] Solution</nowiki>]
 
 
|-
 
|-
 
| 11
 
| 11
||
+
|
* [ME01] Run-length message decoding
+
|
||
+
|
[[:File:Coe164_2020s2_ME01.pdf | [ME01] Specifications]]<br>
 
[https://docs.google.com/forms/d/e/1FAIpQLSfbLCDj52EznOgOfy4x5Iwxtox5EAiSDMcbNGEhPjk4Gyafzw/viewform <nowiki>[ME01][bin] Submission Bin</nowiki>]
 
||
 
[https://colab.research.google.com/drive/1QbMIl-x1Cmrqa0uUycd7Gcl7_ysuCSKj <nowiki>[ME01][oj] Online Judge</nowiki>]<br>
 
[https://colab.research.google.com/drive/113hNorz8Q1NCysImqVHFec-mnL1Nf4bP <nowiki>[ME01][ans] Solution</nowiki>]
 
 
|-
 
|-
 
| 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
||
+
|
* [MP02] The fastest fast Fourier transform?
+
|
||
+
|
[[:File:Coe164_2020s2_MP02.pdf | [MP02] Specifications]]<br>
 
[https://docs.google.com/forms/d/e/1FAIpQLSfbLCDj52EznOgOfy4x5Iwxtox5EAiSDMcbNGEhPjk4Gyafzw/viewform <nowiki>[MP02][bin] Submission Bin</nowiki>]
 
||
 
[https://app.tryeraser.com/workspace/wiju6ACAqTnIP3uK79sv <nowiki>[MP02][wb] Fast Fourier Transform</nowiki>]<br>
 
[https://pastebin.com/p02Hmnww <nowiki>[MP02][note] Notes</nowiki>] - PW: notes_sfft<br>
 
[https://script.google.com/a/macros/eee.upd.edu.ph/s/AKfycbz4ccLXJF9no2SiLrLhWhYOxo0u8khxuk4NIWzrpE33v8HBlejpForer6uvZkLf2JOCWA/exec <nowiki>[MP02] Buddy Assignments</nowiki>]<br>
 
[https://colab.research.google.com/drive/1kFQxU1jzIazshac1UjRUQxiYWv7ipRF8 <nowiki>[MP02][oj] Online Judge (FFT)</nowiki>]<br>
 
[https://colab.research.google.com/drive/1fpTjh1uBLwN-KlAtylb6b723xCom1hZ8 <nowiki>[MP02][oj] Online Judge (IFFT)</nowiki>]<br>
 
[https://colab.research.google.com/drive/12WKJqO9BYtgQhTI04RXnu4IDht-XLwoQ <nowiki>[MP02][ans] Solution</nowiki>]
 
 
|-
 
|-
 
| 14
 
| 14
||
+
| colspan="3" | <div style="text-align: center;">'''READING BREAK'''</div>
* [ME02] Tumbasang linyar gamit ang paraang Gauss-Jordan
 
||
 
[[:File:Coe164_2020s2_ME02.pdf | [ME02] Takda]]<br>
 
[https://docs.google.com/forms/d/e/1FAIpQLSfbLCDj52EznOgOfy4x5Iwxtox5EAiSDMcbNGEhPjk4Gyafzw/viewform <nowiki>[MP02][bin] Lugar-Pasahan</nowiki>]
 
||
 
[https://app.tryeraser.com/workspace/ahvG8lUiStM7uwGW8zsO <nowiki>[ME02][wb] Paraang Gauss-Jordan</nowiki>]<br>
 
[https://colab.research.google.com/drive/1VXnqIEgy9KdhqvsU69Wb5QU4yb4Oy0y0 <nowiki>[ME02][oj] Hukom</nowiki>]<br>
 
[https://colab.research.google.com/drive/126T9yrmVNPSQyG861e_o_riMtcrtszuV <nowiki>[ME02][ans] Sagot</nowiki>]
 
 
|-
 
|-
 
| 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
 +
|
 +
|
 +
|
 +
|-
 +
| 17
 +
|
 +
|
 +
|
 
|}
 
|}
  

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
  • Course overview and synopsis
  • Course requirements

[slides]
[syllabus]

1
2
3
4

[SE01] Run-length message decoding

[SE01] Specifications
[SE01][bin] Submission Bin

[SE01][oj] Online Judge

5
6
7

[SE02] Website Priority Queueing

[SE02] Specifications
[SE02][bin] Submission Bin

[SE02][wb] Priority Heap and Binary Tree Traversal
[SE02][oj] Online Judge

8
READING BREAK
9
LENTEN BREAK
10
11
12

[SE03] A Faster Matrix Multiplication?

[SE03] Specifications
[SE03][bin] Submission Bin

[SE03][wb] Strassen Algorithm
[SE03][oj] Online Judge

13
14
READING BREAK
15

[CP] Faster Flights With Barcodes

[CP] Specifications
[CP][bin] Submission Bin

[CP][wb] Reed-Solomon Error Correction + Barcode Decoding
[CP][wb] Finite Fields
[CP][oj] Online Judge

16
17

Grading Rubric

60% Software exercises
40% Software projects

Announcements

February 2021