Case Design of Computation Complexity Theory Course Based on Comparative Analysis
As the theoretical fundamental of algorithm analysis,computation complexity theory is a sub-discipline of theoretical computer science,with which,consumptions of various resources required in computing are quantitatively analyzed using mathematical methods,and the interrelationship and basic properties of computation complexity between various problems are also studied. Actual teaching process of computation complexity theory faces the challenges such as wide knowledge span,strong practicality,and multiple application backgrounds. Thus,designing the teaching content and improving the teaching methods of computation complexity theory course are issues desired continuous research attentions. In this paper,a hierarchical case-based teaching design for computation complexity theory is proposed based on the comparative analysis method,where examples with high practice and teaching efficiency are utilized to explain the theory from the easy to the complicated to help students gradually deepen the understanding and mastery of computation complexity courses.
万方数据
维普
