本课程是微电子科学与工程专业本科生的基础选修课，面向本专业的特点和需求，培养学生算法设计与分析的知识和能力，支持学生设计与验证针对EDA、算法映射、软硬件设计等微电子工程问题的解决方案。 课程重点讲述基础计算理论、典型算法设计、算法分析方法等内容。基础计算理论涵盖可计算性、计算复杂性的最基础内容，以加强学生对NP等概念的理解。典型算法设计部分对常见算法进行讲授，包括分治算法、动态规划、贪心算法、随机算法、近似算法、树搜索策略、优化算法等，并会介绍相关算法在微电子领域的具体应用。算法分析部分重点讲授算法的渐进复杂度分析，同时会对摊销分析方法进行介绍。同时，本课程将会安排少量实验课时，以增强理论与实际的结合。 This course is a basic elective course for undergraduates majoring in microelectronics science and engineering. Based on the characteristics and needs of the major, it cultivates students' knowledge and ability in algorithm design and analysis, and then supports students to design and verify solutions for microelectronics engineering problems, e.g., EDA, algorithm mapping, software and hardware design, etc. The course focuses on basic computing theory, typical algorithm design, algorithm analysis methods, etc. Basic computing theory covers the most basic content of computability and computational complexity to strengthen students' understanding of concepts such as NP. In the typical algorithm design part, common algorithms are taught, including divide and conquer algorithm, dynamic programming, greedy algorithm, random algorithm, approximate algorithm, tree search strategy, optimization algorithm, etc., and the specific application of these algorithms in microelectronics will be introduced. Algorithm analysis focuses on the asymptotic complexity analysis of the algorithm, and will also introduce the amortization analysis method. Finally, some experimental hours will be arranged to enhance the combination of theory and practice.
