Course Objectives:

The course of computer theory is to study how to use algorithms to solve problems effectively. Computational theory is the theoretical basis of computer science. This course introduces the main content of computing theory to the students, makes them understand the important problems and results in the field of computing theory, strengthens their theoretical computer foundation, helps them understand the knowledge of algorithms in theoretical computer science, and provides them a solid theoretical support for the research of computer science and technology and some other related fields.

Course Requirements:

This course is mainly for the senior students of the International College, who are majoring in computer science. They are required to have good mathematical basis and theoretical calculation basis. As the course of 《algorithm design and analysis》 is the core supporting course for the computer major to carry out scientific research and engineering application, it is suggested that a relevant course be taken as the first course of this course.

Course Contents:

This course mainly introduces the basic knowledge of computational theory topics, including the theory of finite automata, Turing machine topics, and computability (NP completeness, PSPACE, BPP, etc.) topics. Facing the special characteristics of computer network and communication, this lecture introduces SPIN, DD, RUMOR, LEACH and other algorithms to ensure end-to-end communication, and introduces MIN-MAX and other theoretical algorithms of mobile location computing.

Credits: 2