计科数学上

           The course offers an introduction to discrete mathematics oriented toward computer science and engineering. Its coverage divides roughly into thirds: fundamental concepts of mathematics,discrete structures, and discrete probability theory. Focus on educating students to explain and apply the basic methods of discrete (noncontinuous) mathematics in computer science. The students will be able to use these methods in subsequent courses in the design and analysis of algorithms, computability theory, software engineering, and computer systems. 
  LEC # TOPICS 1 Introduction and proofs 2 Induction 3 Strong induction 4 Number theory I 5 Number theory II 6 Graph theory and coloring 7 Matching problems 8 Graph theory II: minimum spanning trees 9 Communication networks 10 Graph theory III 11 Relations, partial orders, and scheduling 12 Sums 13 Sums and asymptotics 14 Divide and conquer recurrences   Midterm 15 Linear recurrences 16 Counting rules I 17 Counting rules II 18 Probability introduction 19 Conditional probability 20 Independence 21 Random variables 22 Expectation I 23 Expectation II 24 Large deviations 25 Random walks

内容版权声明：除非注明，否则皆为本站转载文章。文章及图片版权归原作者所有，如有侵权请联系我们，我们立刻删除。