課程年度：
顯示：
11301
工程
訊號與系統〡Offered in English
洪樂文 教授
This course introduces basic mathematical tools to analyze continuous/discrete-time signals and linear time-invariant systems that may be encountered in many disciplines of electrical engineering, such as signal processing, communications, circuit design, and control. In this course, we will cover topics such as convolution, filtering, sampling, Fourier series, Fourier transform, Laplace transform, and the z-transform. In essence, students will learn how to view and process signals in both time and frequency domains.
課程簡述
Brief course description
This course introduces basic mathematical tools to analyze continuous/discrete-time signals and linear time-invariant systems that may be encountered in many disciplines of electrical engineering, such as signal processing, communications, circuit design, and control. In this course, we will cover topics such as convolution, filtering, sampling, Fourier series, Fourier transform, Laplace transform, and the z-transform. In essence, students will learn how to view and process signals in both time and frequency domains.
課程大綱
Syllabus
| ♠ | Goal and Overview |
This course introduces basic mathematical tools to analyze continuous/discrete-time signals and linear time-invariant systems that may be encountered in many disciplines of electrical engineering, such as signal processing, communications, circuit design, and control. In this course, we will cover topics such as convolution, filtering, sampling, Fourier series, Fourier transform, Laplace transform, and the z-transform. In essence, students will learn how to view and process signals in both time and frequency domains. | |
| ♠ | Related Topics |
| Calculus, Linear Algebra. | |
指定用書
Textbook Book
| ♠ | Alan V. Oppenheim and Alan S. Willsky, with S. Hamid Nawab, Signals and |
| Systems, 2nd Ed., Pearson Education Limited, 2014 (or Prentice-Hall, 1997) | |
| ISBN：9781292025902 |
參考用書
References: (not required)
| 1. | |
| ISBN：9780367737771 | |
| 2. | |
| John Wiley & Sons,Inc., 2003 | |
| ISBN：9780471378518 |
教學大綱
Syllabus:
瀏覽人次：73105
11301
工程
分散式學習的最佳化和通訊演算法
洪樂文 教授
Syllabus
| 第1R講 | 分散式學習的最佳化和通訊演算法 〡Internet-of-Things(IOT)Applications |
Learning from Decentralized Datasets- Optimization and Communication Aspects Centralized Architecture Distributed Architecture Mobile Application Medical Applications Internet-of-Things (IoT) Applications Basic (Supervised) Learning Task Distributed Implementation of GD | |
| 第2R講 | 分散式學習的最佳化和通訊演算法 〡Example:Federated Multi-task Learning |
Alternating Direction Method of Multipliers Core Challenges Example I: Federated Multi-task Learning Example II: Multi-View Clustering Go to Examples Go to Examples Example I: Federated Multi-task Learning | |
| 第3R講 | 分散式學習的最佳化和通訊演算法〡Example II :Multi-View Clustering |
| Example II: Multi-View Clustering Data Collection Local Subspace Clustering Center Broadcast | |
| |
瀏覽人次：7251
11201
工程
應用密碼學 〡Offered in English
艾米爾 教授
his course is intended for graduate students. This course will cover the basics of symmetriccryptography, public-key cryptography, hash functions, message authentication codes, digital signatures,key management and distribution, and other fundamental cryptographic primitives.
課程目標
Course Objective
This course is intended for graduate students. This course will cover the basics of symmetric cryptography, public-key cryptography, hash functions, message authentication codes, digital signatures, key management and distribution, and other fundamental cryptographic primitives. Then, we use the primitives to build provable secure protocols such as identification schemes, zero-knowledge proofs, commitment schemes, secret sharing, and electronic election system. By learning some existing secure protocols, you’ll learn how to build provable secure systems.
授課內容
Course Description
| ♠ | Symmetric-key encryption (Chapter 2) |
| ♠ | Algebra & number theory basics (Chapter 3) |
| ♠ | Public-key cryptography (Chapter 4) |
| ♠ | Cryptographic protocols (Chapter 5) |
參考書籍
Textbook/References
先備知識
Requirements
| 講授 | |
| ♠ | Computer Networks |
| ♠ | Introduction to Algorithms |
| ♠ | Probability |
評分方式
methods of grading
| ♠ | Four Homework Assignments |
| ♠ | Exams |
| i.Mid-Term ii.Final | |
| ♠ | Evaluation |
| i.Homework: 50% ＋ 1.Assignments 50% 2.Practical experiments 2×10% [bonus points] | |
| ii.Mid-Term 25% | |
| iii.Final 25% | |
＊此為英文課程
瀏覽人次：29108
11102
工程
計算機程式設計1〡詹振宏.袁晟洋助教研習課
詹振宏 / 袁晟洋 教授
This course is aimed to help the students learn how to program in C. There will be several labs, two midterm exams, one final exam, and the final project, with the following percentages: 1. Online judge labs (20%), 2. Two midterm exams (30%), 3. One final exam (30%), 4. Final project (20%). The textbook is S. Prata, C PRIMER PLUS. Printout lecture notes will be available.
課程大綱
Syllabus
This course is aimed to help the students learn how to program in C.There will be several labs, two midterm exams, one final exam, and the final project,with the following percentages:
| 1. | Online judge labs (20%) — every two weeks |
| 2. | Two midterm exams (30%) |
| 3. | One final exam (30%) |
| 4. | Final project (20%) |
影片章節內容
Video chapter content / 可參閱以下課程連結 !
Video chapter content / 可參閱以下課程連結 !
| ♠ | 10820陳煥宗教授程式設計1 - 遠距教學版 |
| ♠ | 10720陳煥宗教授程式設計1 - 資工版 |
| https://ocw.nthu.edu.tw/ocw/index.php?page=course&cid=240& | |
| ♠ | 10401陳煥宗教授程式設計1 - 開放式課程 |
| https://ocw.nthu.edu.tw/ocw/index.php?page=course&cid=134& |
指定用書
Textbook
Textbook
| ♠ | S. Prata, C PRIMER PLUS |
| ♠ | Lecture notes - https://reurl.cc/OExyMX |
| |
.png)
瀏覽人次：35063
11102
工程
計算機程式設計2 〡詹振宏.袁晟洋助教研習課
詹振宏 / 袁晟洋 教授
清華大學資工系必修課，主要對象為大一學生，延續計算機程式設計一，繼續磨練程式能力。
課程概述
Course Description
| 1. | 延續計算機程式設計一，繼續鍛鍊程式能力! |
| 2. | 透過實作來認識資訊工程基礎知識與技術! |
| ♠ | 修課學生必須 修過程式設計一 (等同 EECS/EE 程式設計） 或是 通過開學第一週舉辦 |
| 定，符合資格才能以加簽方式選課。 | |
| ♠ | 修課學生必須 修過程式設計一並取得學分 (等同 EECS/EE 程式設計） |
|
| 或是 通過開學第一週舉辦的程式設計一能力檢定，符合資格才能以加簽方式選課。 |
| ♠ | 採用榮譽制，請對自己負責，憑實力完成! |
|
| 這也是對自己的程式能力的檢驗，如果沒能力達成，可能會跟不上程設二的課程難度和進度。 |
|
|
授課大綱
Syllabus / 可參閱以下連結 !
| ♠ | 2020計算機程式設計2 |
| ♠ | 2022計算機程式設計2 |
| https://ocw.nthu.edu.tw/ocw/index.php?page=course&cid=323& | |
授課形式
Teaching Method
| ♠ | 遠距同步上課 |
| ♠ | 電腦教室實體上機考試 |
瀏覽人次：16994
11102
工程
2020計算機程式設計2
陳煥宗 教授
清華大學資工系必修課，主要對象為大一學生，延續計算機程式設計一，繼續磨練程式能力。
課程概述
Course Description
| 1. | 延續計算機程式設計一，繼續鍛鍊程式能力! |
| 2. | 透過實作來認識資訊工程基礎知識與技術! |
| ♠ | 修課學生必須 修過程式設計一 (等同 EECS/EE 程式設計） 或是 通過開學第一週舉辦定，符合資格才能 |
| 以加簽方式選課。 | |
| ♠ | 修課學生必須 修過程式設計一並取得學分 (等同 EECS/EE 程式設計）或是通過開學第一週舉辦的程式 |
|
| 設計一能力檢定，符合資格才能以加簽方式選課。 |
| ♠ | 採用榮譽制，請對自己負責，憑實力完成! |
|
| 這也是對自己的程式能力的檢驗，如果沒能力達成，可能會跟不上程設二的課程難度和進度。 |
| |
.png)
---------------------------------------------------------------------------------------------| 【對象】 | 還沒拿到「資工系計算機程式設計一、「電機系計算機程式設計」、「電資班 |
| 計算機程式設計」任何一個科目學分的同學 | |
| 【題目】 | http://acm.cs.nthu.edu.tw/contest/2084/ |
| 【註冊帳號】 | 必須採用 IPHTC＋學號格式，例如 IPHTC109062500 |
| 【條件】 | 在期限內，用規定的帳號，答對全部題目，通過檢定符合條件可在第二週上課時加簽 |
| |
指定用書
Text Books
| ♠ | 無指定用書，https://reurl.cc/bG1LAX |
授課大綱
Syllabus
| 1. | 課程介紹、加簽、程設一資格檢定測驗 | 11. | Templates |
| 2. | 複習 C 指標 | 12. | Graph and Path Finding |
| 3. | Circular linked Lists | 13. | Search Problems |
| 4. | Josephus Problem | 14. | Search Problems |
| 5. | Binary Trees | 15. | Modern C＋＋ |
| 6. | Binary expressions, Syntax Trees | 16. | Modern C＋＋ |
| 7. | Calculator Tree, Assembly | 17. | Final Exam |
| 8. | Midterm Exam & Written Exam | 18. | Project Demo |
| 9. | C＋＋ Introduction | ||
| 10. | Derived Class | ||
movie chapter
| 第1R講 | Week 02 | 課程簡介、C 指標複習、Linked List 介紹 |
| 第2R講 | Week 03 Part 1 | Linked List 補充 (double pointer) |
| 第3R講 | Week 03 Part 2 | Linked List 補充 (delete, swap) |
| 第4R講 | Week 04 Part 1 | 資料結構與演算法介紹 (Josephus problem)、時間複雜度 |
| 第5R講 | Week 04 Part 2 | 時間複雜度介紹 (Big-O notation)、Josephus Problem |
| 第6R講 | Week 04 Part 3 | Josephus Problem (code 實作) |
| 第7R講 | Week 04 Part 4 | Josephus Problem (code 實作, 更高效的解法) |
| 第8R講 | Week 05 | Binary Tree, Tree Order (pre-order, in-order, post-order) |
| 第9R講 | Week 06 | Binary Expression, Syntax Tree |
| 第10R講 | Week 07 Part 1 | Calculator, Compiler (lexer, parser) |
| 第11R講 | Week 07 Part 2 | Calculator, Compiler (lexer, parser), Grammar |
| 第12R講 | Week 08 | Assembly, Computer Architecture |
| 第13R講 | Week 09 | C＋＋ Introduction (syntax, I/O, 字串, array, class) |
| 第14R講 | Week 11 | C＋＋ Classes (introduction, derived classes, abstract classes) |
| 第15R講 | Week 12 | C＋＋ Classes (examples: list, vector) |
| 第16R講 | Week 13 | C＋＋ Classes (vector), Standard Library, 使用演示 (猜數字) |
| 第17R講 | Week 14 | Graph and Path Finding, Standard Library |
| 第18R講 | Week 15 Part 1 | Problem Solving Using C＋＋ (water jug) |
| 第19R講 | Week 15 Part 1.5 | Problem Solving Using C＋＋ (water jug) |
| 第20R講 | Week 16 | Problem Solving Using C＋＋ (missionary, torch) |
| 第21R講 | Week 17 | Week 17〡C＋＋ 17 and C＋＋ 20 |
授課形式
Teaching Method
| ♠ | 遠距同步上課 |
| ♠ | 電腦教室實體上機考試 |
成績考核
Evaluation
Evaluation
| ♠ | 10%written exam、30%midterm exam、30%final exam、10%mini project、 |
| 20%big project & hackathon |
瀏覽人次：30255
11102
工程
2022 計算機程式設計2
陳煥宗 教授
清華大學資工系必修課，主要對象為大一學生，延續計算機程式設計一，繼續磨練程式能力。
有意願修課的同學，請直接從校務資訊系統的加簽電子表單提出申請!
| ♠ | 這門課是以遠距直播方式上課，上課時間是每個星期二晚上 6:30-9:20。 |
| 每個星期四晚上的助教時間，也是以直播方式講解。期中考、期末考則另外會安排在電腦教室實體上機考試。 | |
| ♠ | 9/13 開學第一堂課，請直接進入 Microsoft Teams 線上上課： |
| Microsoft Teams Channel 直播連結是https://tinyurl.com/2f3r4uuz | |
| ♠ | 只要使用 NTHU Office365 帳號可以直接加入課程群組。 |
| 校外同學請提供 Microsoft Teams 帳號，我們會手動將你加入群組。 |
課程概述
Course Description
| 1. | 延續計算機程式設計一，繼續鍛鍊程式能力! |
| 2. | 透過實作來認識資訊工程基礎知識與技術! |
| ♠ | 修課學生必須先修過!!!! |
| (1). 「資工系計算機程式設計一」 (2). 「電機系計算機程式設計」 (3). 「電資班計算機程式設計」三門課程其中任何一門課。 | |
| ♠ | 如果未滿足上述條件，則必須通過程式設計檢定。 |
| 程式設計檢定採用榮譽制，請對自己負責，憑實力完成，這也是對自己的程式能力的檢驗。如果沒能力達成，可能會跟不上程設二的課程難度和進度。 | |
| ♠ | 線上作答題目，稍後會再公告。題目難度相當於程式設計一期末考。 |
| ♠ | 截止期限：2022/09/20 00:00:00 |
指定用書
Text Books
| ♠ | 無指定用書 |
| ♠ | |
授課大綱
Syllabus
| 1. | 課程介紹 | 11. | Templates |
| 2. | 複習 C 指標 | 12. | Graph and Path Finding |
| 3. | Circular linked Lists | 13. | Search Problems |
| 4. | Josephus Problem | 14. | Search Problems |
| 5. | Binary Trees | 15. | Modern C＋＋ |
| 6. | Binary expressions, Syntax Trees | 16. | Modern C＋＋ |
| 7. | Calculator Tree, Assembly | 17. | Final Exam |
| 8. | Midterm Exam & Written Exam | 18. | Project Demo |
| 9. | C＋＋ Introduction | ||
| 10. | Derived Class | ||
Video chapter content
| 第1R講 | Week 02 | C 指標複習、Linked List (singly, circular) 介紹 |
| 第2R講 | Week 03 | 課程日程、Linked List (double pointer) |
| 第3R講 | Week 04 | Josephus Problem (array, linked list, recursive) |
| 第4R講 | Week 05 | Binary Tree, Tree Order (pre-order, in-order, post-order) |
| 第5R講 | Week 06 | Binary Expression, Syntax Tree |
| 第6R講 | Week 07 | Calculator, Compiler (lexer, parser) |
| 第7R講 | Week 08 | Assembly, Computer Architecture |
| 第8R講 | Week 09 | C＋＋ Introduction (syntax, I/O, array, class) |
| 第9R講 | Week 10 | C＋＋ Classes (introduction, derived classes, abstract classes) |
| 第10R講 | Week 12 | C＋＋ Classes (examples: list, vector) |
| 第11R講 | Week 13 | C＋＋ Classes (examples: vector) |
| 第12R講 | Week 14 | Standard Library, Graph and Path Finding |
| 第13R講 | Week 15 | Problem Solving Using C＋＋ (water jug) |
| 第14R講 | Week 16 | Problem Solving Using C＋＋ (missionary, torch) |
| 第15R講 | Week 17 | C＋＋ 17 and C＋＋ 20 |
授課形式
Teaching Method
| ♠ | 遠距同步上課 |
| ♠ | 電腦教室實體上機考試 |
成績考核
Evaluation
Evaluation
| ♠ | 若因防疫規定而影響實體考試的執行，各項成績考核的分配 |
| 比例可能會依情況因應調整! | |
| | 10% written exam |
| | 30% midterm exam |
| | 30% final exam |
| | 10% mini project |
| | 20% big project & hackathon |
瀏覽人次：27207
11101
工程
作業系統〡Offered in English
周百祥 教授
This course covers fundamental concepts in operating systems for computers, including multiprogramming, interrupt, processes, kernel, parallelism...
Course Description
This course covers fundamental concepts in operating systems for computers,including multiprogramming,interrupt, processes, kernel, parallelism, critical sections, deadlocks,communication, multiprocessing,multilevel memory management, binding, name management, file systems,protection, resource allocation,scheduling. Experience with concurrent programming, synchronization mechanisms, interprocess communication.
Textbook
| Silberschatz, P. Galvin, and G. Gangne, Operating System Concepts, | |
| 10th Edition (International Student Version), John Wiley & Sons, Inc. | |
Reference
| ♠ | Small Device C Compiler, http://sdcc.sourceforge.net/ |
| ♠ | Slides:https://ocw.nthu.edu.tw/ocw/index.php?page=newsContent&id=692 |
Teaching Method
Three hours of lectures per week, weekly written and programming assignments,one final project with five checkpoints
Syllabus
.png)
瀏覽人次：98505
11101
工程
資料結構導論
韓永楷 教授
「資料結構」是學習以聰明的方法去儲存資料，使得我們在有需要的時候能夠快速有效地把資料擷取....
課程說明
Course Description
「資料結構」是學習以聰明的方法去儲存資料，使得我們在有需要的時候能夠快速有效地把資料擷取。例如我們希望把學生某一科的考試成績整理，使得我們能隨時查詢任何學生的排名。為了節省查詢的時間，我們或許會把學生們的成績從高至低排好，而不會以隨意的順序排列。〈對此問題，其實還有一個更好的方法呢！〉
| Week 1 | Getting Started、Heap |
| ● Introduction ● Sorting 的方法 & 分析 ● Exercise - Insertion Sort ● Sorting 的分析 ● Exercise - Merge Sort ● Growth of Functions ● Exercise - Growth of Functions ● Insertion Sort 上機 ● Heap-1 ● Exercise - Heap I ● Heap-2 ● Exercise - Heap II | |
| Week 2 | Sorting Lower Bound、Basic Data Structures I (List, Queue, Stack) |
| ● Lower Bound on Comparison Sorts - 1 ● Exercise - Lower Bound on Comparison Sorts I ● Lower Bound on Comparison Sorts - 2 ● Exercise - Lower Bound on Comparison Sorts II ● Pointers in C ● Basic Data Structure Ⅰ - 1 ● Basic Data Structure Ⅰ - 2 ● Exercise - Basic Data Structure I ● Josephus 上機 ● Exercise - Josephus Problem ● Balanced 括號上機 ● Exercise - Balanced Parentheses ● List 上機_insert ● List 上機_delete | |
| Week 3 | Basic Data Structures II (Tree, Graph)、Graph and Tree Traversals I |
| (BFS, DFS) | |
| ● Tree and Graph ● Exercise - Tree ● Breadth First Search ● Exercise - Breadth First Search ● Depth First Search ● Exercise - Depth First Search ● Depth First Search 分析 | |
| Week 4 | Graph and Tree Traversals II (Tree Traversals, Expression Tree )、 |
| | Graph and Tree Traversals III (Topological Sort) |
| ● Tree Traversal ● Exercise - Tree Traversal ● Expression Tree & Postfix Notation of an Expression ● Infix-Postfix Coversion ● Exercise - Expression ● Topological Sort ● Topological Sort 證明 ● Exercise - Topological Sort ● Two IQ Questions ● Exercise - Josephus Problem Revisited | |
| Week 5 | Searching Set Data I (Binary Search Tree) |
| ● Binary Search Tree ● Binary Search Tree 實作 (Min / Max) ● Binary Search Tree 實作 (Search / Predecessor) ● Binary Search Tree 實作 (Insert / Delete) ● Binary Search Tree 實作 (Delete) - Case 1 & 2 ● Binary Search Tree 實作 (Delete) - Case 3 ● BST上機_insert ● BST上機_delete_1 ● BST上機_delete_2 ● BST上機 - 3 ● Exercise - Binary Search Tree | |
| Week 6 | Searching Set Data II (AVL Tree) |
| ● AVL Tree ● AVL Tree - Rotation ● AVL Tree - Insertion 的情形 ● AVL Tree - Insertion實作 Case 2.2 ● AVL Tree - Insertion 實作 Case 2.3 ● AVL Tree Insert 補充 & Delete ● Augmenting Data Structure ● Exercise - AVL Tree | |
| Week 7 | Searching Set Data III (B-Tree) |
| ● B-tree EM Model ● B-tree insert ● B-tree delete ● Exercise - B Tree I ● Exercise - B Tree II | |
| Week 8 | Hashing (Chaining, Open Addressing)、Suffix Tree and Suffix Array |
| ● Hashing ● Common Hash Function ● Exercise - Hashing ● Indexing Strings & Suffix Array ● Exercise - Suffix Array | |
指定用書
Text Book
| ♠ | Introuction to Algorithms |
| Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest, Clifford Stein | |
| ♠ | Fundamentals of Data Structures in C＋＋ |
| Ellis Horowitz, Sartaj Sahni, Dinesh Mehta |
參考書籍
References
| ♠ | Algorithms in C＋＋Robert Sedgewick |
先修課程
Advanced Placement
| ♠ | C/C＋＋ Programming |
瀏覽人次：52239
11101
工程
電子學〡Offered in English
金雅琴 教授
This course is an introductory course of microelectronics. We will focus on the fundamental knowledge of microelectronic circuits and emphasize the design- oriented approach...
課程說明
Course Description
This course is an introductory course of microelectronics. We will focus onthe fundamental knowledge of microelectronic circuits and emphasize the design-oriented approach. This course introduces the most important concepts for design of analog circuits such as semiconductor diodes and transistors, and various amplifier configurations. The frequency response, differential pairs,
multistageamplifiers are also included. By developing solid understanding of basic knowledge, learning microelectronics could be enjoyable.
指定用書
Text Books
| ♠ | B. Razavi, "Fundamentals of Microelectronics," Wiley, 2008. |
參考書籍
References
| ♠ | |
教學方式
Teaching Method
Power point handouts are used in this class together with a tablet computer for equation derivation and additional materials. The course materials are also recorded by the software "powercam" and uploaded in LMS system for easy access. A quiz is held on a bi-weekly basis to help the students following the course schedule. The homework is also assigned bi-weekly. The students also have the opportunity to use the CAD tool (SPICE) for circuit design and verify the materials learned in the class.
教學進度
Syllabus
| 1. | Introduction to microelectronics (ch. 1) |
| - Examples of electronic systems - Basic circuit theorems | |
| 2. | Basic physics of semiconductors and diodes (ch. 2 and ch. 3) |
| - Semiconductor material properties - PN junction and diodes - Diode circuits and applications | |
| 3. | Basic physics of transistors and their equivalent circuit models |
| (ch. 4 and ch. 6) | |
| - Basic structures and characteristics of MOSFETs and BJTs - Equivalent circuit model of MOSFETs and BJTs - Large-signal and small-signal operation | |
| 4. | Single-stage (multi-stage) amplifiers and frequency response |
| (ch. 5, ch. 7, ch. 9, and ch. 11) | |
| - MOSFET and BJT amplifier topologies (CS, CG, CD, and cascode) - Transfer function and Bode's plot - Frequency response of different amplifiers | |
| 5. | Differential amplifiers (ch. 9 and ch. 10) |
| - Basic MOS and BJT differential pairs | |
| - Large-signal and small-signal analysis | |
| - Current mirror and active load | |
瀏覽人次：51376