Both sides previous revision
Previous revision
Next revision
|
Previous revision
Next revision
Both sides next revision
|
start [2022/06/13 04:53] 204251164 [Announcements] |
start [2022/06/13 05:01] 204251164 [Tentative Assignment Schedule (Due in 7 days)] |
| |
===== Exam Dates ===== | ===== Exam Dates ===== |
* **Midterm Exam** on Monday 16 August 2564 Time 12:00-15:00 | * **Midterm Exam** on Thursday 1 September 2022 Time 12:00-15:00 |
* **Final Exam** on Thursday 28 October 2564 Time 15:30-18:30 | * **Final Exam** on Saturday 5 November 2022 Time 15:30-18:30 |
| |
===== Lecture Schedule ===== | ===== Lecture Schedule ===== |
^ Week ^ Date ^ Topics ^ | ^ Week ^ Topics ^ |
| 1 | 21-25 Jun 64 | {{ https://drive.google.com/file/d/1_KifSLCCCxQfTnWxdmxezm6fixGepZ4P/view?usp=sharing | Problem Solving and Concept of Abstraction}} | | | 1 | {{ https://drive.google.com/file/d/1_KifSLCCCxQfTnWxdmxezm6fixGepZ4P/view?usp=sharing | Problem Solving and Concept of Abstraction}} | |
| 2 | 28 Jun 64 - 2 Jul 64 | {{ https://drive.google.com/file/d/1rchV1c00uMbW7hEuEuVwKT9y_4mrzflA/view?usp=sharing | Analysis of Algorithms}} | | | 2 | {{ https://drive.google.com/file/d/1rchV1c00uMbW7hEuEuVwKT9y_4mrzflA/view?usp=sharing | Analysis of Algorithms}} | |
| 3-4 | 5-16 Jul 64 | Linear lists {{https://drive.google.com/file/d/1Xr1k1PsOVrp7Y0bqU62eRUqwHgNJuvO2/view?usp=sharing | #1 }}, {{ https://drive.google.com/file/d/1BCBwDuoAn2BfblcJ30P1tixmOO71Vh-l/view?usp=sharing | #2}} | | | 3-4 | Linear lists {{https://drive.google.com/file/d/1Xr1k1PsOVrp7Y0bqU62eRUqwHgNJuvO2/view?usp=sharing | #1 }}, {{ https://drive.google.com/file/d/1BCBwDuoAn2BfblcJ30P1tixmOO71Vh-l/view?usp=sharing | #2}} | |
| 5 | 19-23 Jul 64 | Stacks {{https://drive.google.com/file/d/1kX3zPQ0Em0MD__sYLYrqtWTd-QPSN2rv/view?usp=sharing | #1}} , {{https://drive.google.com/file/d/1ejko_xQaHIvy366zbRbwcM7eRKfmYNDY/view?usp=sharing| #2}} | | | 5 | Stacks {{https://drive.google.com/file/d/1kX3zPQ0Em0MD__sYLYrqtWTd-QPSN2rv/view?usp=sharing | #1}} , {{https://drive.google.com/file/d/1ejko_xQaHIvy366zbRbwcM7eRKfmYNDY/view?usp=sharing| #2}} | |
| 6-7 |26 Jul-6 Aug 64 | Queues {{https://drive.google.com/file/d/1Og4Y484d_C0p7IbsqyxYeEHTHkKtA6Si/view?usp=sharing|#1}}, {{https://drive.google.com/file/d/1AEm1ESUvcJob8dpgpfcUW6ASxLP5S3vd/view?usp=sharing| #2}} | | | 6-7 | Queues {{https://drive.google.com/file/d/1Og4Y484d_C0p7IbsqyxYeEHTHkKtA6Si/view?usp=sharing|#1}}, {{https://drive.google.com/file/d/1AEm1ESUvcJob8dpgpfcUW6ASxLP5S3vd/view?usp=sharing| #2}} | |
| 8 |9-13 Aug 64| {{https://drive.google.com/file/d/1Gv5rgAdvbqpaBP1rOnQrezUEawOt_1vN/view?usp=sharing|Priority Queues}} | | | 8 | {{https://drive.google.com/file/d/1Gv5rgAdvbqpaBP1rOnQrezUEawOt_1vN/view?usp=sharing|Priority Queues}} | |
| **Midterm Exam: Monday 16 August 2564 Time 11:00-15:00** ||| | | **Midterm Exam: Thursday 1 September 2022 Time 12:00-15:00** ||| |
| 8-9 | 23-27 Aug 64| Set, Map and Hashing {{https://drive.google.com/file/d/1RXP96vrxmmGgIwltEWmyxdkkZ8XInb1C/view?usp=sharing| #1}}, {{https://drive.google.com/file/d/1kxk8Xb_bfF6BVO6cby1rd3XjdPRvJhKZ/view?usp=sharing|#2}}, {{https://drive.google.com/file/d/14OVDB4QV0pj4PrJpc9KMoTYdn-2p_03m/view?usp=sharing|#3}}, | | | 8-9 | Set, Map and Hashing {{https://drive.google.com/file/d/1RXP96vrxmmGgIwltEWmyxdkkZ8XInb1C/view?usp=sharing| #1}}, {{https://drive.google.com/file/d/1kxk8Xb_bfF6BVO6cby1rd3XjdPRvJhKZ/view?usp=sharing|#2}}, {{https://drive.google.com/file/d/14OVDB4QV0pj4PrJpc9KMoTYdn-2p_03m/view?usp=sharing|#3}}, | |
| 10-11 | 30 Aug - 10 Sep 64 | Searching and Sorting {{https://drive.google.com/file/d/1Dze2gKex-YFGMtb4x8ATIGtxCHKHogZZ/view?usp=sharing|#1}}, {{https://drive.google.com/file/d/1Xz_G_vXpqO7YjHwbW3-W-CLfb4UT1d2o/view?usp=sharing|#2}} | | | 10-11 | Searching and Sorting {{https://drive.google.com/file/d/1Dze2gKex-YFGMtb4x8ATIGtxCHKHogZZ/view?usp=sharing|#1}}, {{https://drive.google.com/file/d/1Xz_G_vXpqO7YjHwbW3-W-CLfb4UT1d2o/view?usp=sharing|#2}} | |
| 12-13 | 13-24 Sep 64 | Trees {{https://drive.google.com/file/d/1mMufNDrcE1nS8dNPUYERBPxP-veZMIju/view?usp=sharing|#1}}, {{https://drive.google.com/file/d/1gVPEK9YLucbktvLJgjyGcpSpCPSLpTc1/view?usp=sharing|#2}}, {{https://drive.google.com/file/d/1hRr6X314T_Fa4d3LAGDbgNBXXWB-11dq/view?usp=sharing|#3}}, {{https://drive.google.com/file/d/1sYeb4LWzhAUvTzLXmRvzhHjV89M07qVo/view?usp=sharing|#4}} | | | 12-13 | Trees {{https://drive.google.com/file/d/1mMufNDrcE1nS8dNPUYERBPxP-veZMIju/view?usp=sharing|#1}}, {{https://drive.google.com/file/d/1gVPEK9YLucbktvLJgjyGcpSpCPSLpTc1/view?usp=sharing|#2}}, {{https://drive.google.com/file/d/1hRr6X314T_Fa4d3LAGDbgNBXXWB-11dq/view?usp=sharing|#3}}, {{https://drive.google.com/file/d/1sYeb4LWzhAUvTzLXmRvzhHjV89M07qVo/view?usp=sharing|#4}} | |
| 14-15 | 27 Sep - 8 Oct 64 | Graphs {{https://drive.google.com/file/d/1AQY61vQMao7ko05-HZqoXysP0tLzY5sU/view?usp=sharing|#1}}, {{https://drive.google.com/file/d/1M5YeBzVzrNbb_vwwfZ5ppM9OzU4U0mHn/view?usp=sharing|#2}}, {{https://drive.google.com/file/d/1L1DWyH0i9sSQcMqcShYCUncQyWZht3JM/view?usp=sharing|#3}}, {{https://drive.google.com/file/d/1xpgViw_1k7LNdWujL_BgQLMsKDt3ooOA/view?usp=sharing|#4}} | | | 14-15 | Graphs {{https://drive.google.com/file/d/1AQY61vQMao7ko05-HZqoXysP0tLzY5sU/view?usp=sharing|#1}}, {{https://drive.google.com/file/d/1M5YeBzVzrNbb_vwwfZ5ppM9OzU4U0mHn/view?usp=sharing|#2}}, {{https://drive.google.com/file/d/1L1DWyH0i9sSQcMqcShYCUncQyWZht3JM/view?usp=sharing|#3}}, {{https://drive.google.com/file/d/1xpgViw_1k7LNdWujL_BgQLMsKDt3ooOA/view?usp=sharing|#4}} | |
| **Final Exam: Thursday 28 October 2564 Time 15:30-18:30** ||| | | **Final Exam: Saturday 5 November 2022 Time 15:30-18:30** ||| |
| |
| |
===== Tentative Assignment Schedule (Due in 7 days) ===== | |
^ No. ^ Date ^ (W)ritten/(P)rogramming ^ Topics ^ | |
| 1 | TBA | W | Problem Solving and Concept of Abstraction | | |
| 2 | TBA | W | Analysis of Algorithms | | |
| 3 | TBA | P | Linear Linked List | | |
| 4 | TBA | P | Doubly Linked List | | |
| 5 | TBA | P | Application of Linked List | | |
| 6 | TBA | P | Application of Stacks | | |
| 7 | TBA | P | Queues | | |
| 8 | TBA | P | Priority Queues | | |
| 9 | TBA | W | Set, Map and Hashing | | |
| 10 | TBA | w | Search and Sort | | |
| 11 | TBA | P | Search and Sort | | |
| 12 | TBA | P | Tree Traversal | | |
| 13 | TBA | P | Binary Search Tree | | |
| 14 | TBA | P | Graph | | |
| |
===== Notes on Code Submission ===== | ===== Notes on Code Submission ===== |