授课教师：Dmitry Zaitsev

国籍：乌克兰

职称：教授

教师简介（中英文）：Dmitry Zaitsev教授生活工作在黑海之畔美丽的敖德萨；他多次访问中国，热爱中国文化，痴迷少林和麻将。他是计算机科学、控制科学领域的国际知名专家，科研成果丰硕，教学认真严谨。2020、2021、2022的年双创周本课程受到选课同学一直好评！Zaitsev教授分别于1986年、1991年在乌克兰顿涅斯克理工学院获得应用数学专业学士学位、计算机科学专业硕士学位，2004在乌克兰基辅控制研究所取得自动控制专业博士学位，2006在乌克兰敖德萨国立电信学院取得电信系统与网络专业博士学位，现为乌克兰敖德萨国际环境大学教授。是美国计算机学会会员，IEEE会员，德国波恩Petri网及相关系统模型特设研究组会员，并被列入马奎斯世界名人录。

Professor Dmitry Zaitsev lives and works in the beautiful Odessa by the Black Sea; he has visited China many times, loves Chinese culture, and is obsessed with Shaolin and Mahjong. He is an internationally renowned expert in the field of computer science and control science, with fruitful scientific research results and serious and rigorous teaching. This course in 2020 Double Innovation Week has been well received by students who choose courses! Professor Zaitsev obtained his bachelor's degree in Applied Mathematics and master's degree in computer science from Donetsk Polytechnic Institute (DPI), Ukraine in 1986 and 1991, his doctor's degree in automatic control from Academic Council of Kiev Cybernetics Institute in 2004, and in telecommunication system and network from Academic Council of Odessa National Academy of Telecommunications (ONAT), Ukraine in 2006. Now he is a professor of Odessa State Environmental University, department of Information Technology. He is senior member of the ACM and IEEE, and special research group of Bonn Petri net and related system models in Germany. He has been listed in the Marquis Who's Who.

课程简介（中英文）：本课程主要讲授了算法的基本概念及其复杂度分析，研究如何高效开发算法或者程序。本课程首先从算法及其空间和时间复杂度的概念出发，以图灵机作为计算模型讲解，并介绍了一些不确定性问题。同时包含一些离散数学的内容，如图，树的基本知识。而后分别研究递归算法，排序算法，搜索算法，以及NP问题的本质和目前国际前沿的进展。最后讲解动态规划和程序的设计范式，以此探讨如何高效开发算法和程序。本课程有一定难度，但能学到真东西，认真完成后必有收获！是立志于投身互联网大厂或进一步深造的同学必选此课。

This course mainly introduces the concept of algorithm and its complexity analysis, and how to develop algorithm or program efficiently. This course starts from the concept of algorithm and its space and time complexity, explaining Turing machine as the computation model, and introduces some undecidable problems. At the same time, it contains some basic knowledge of discrete mathematics, such as graph theory and tree. Then the recursive algorithm, the sorting algorithm, the search algorithm, and NP-hard problem are analyzed. In the end, the dynamic programming and paradigms of programming are mentioned. In the current era of algorithms, students who are determined to join the Internet giants must take this course.