離散數學

第十二週題目

有限狀態自動機（Finite State Machine）是由有限個狀態以及在這些狀態之間的轉移和動作等行為所組成的數學模型。

有限狀態自動機可以使用狀態轉移圖（State Transition Diagram）來表示，例如下面的狀態轉移圖，表示的是一個可以用來判斷二進位數是否具有偶數個 0 的有限狀態自動機。「沒有起點的箭頭」指向狀態 S1，表示狀態 S1 是開始狀態（Start State）；狀態 S1 為雙重圓圈，表示狀態 S1 是接受狀態（Accept State）。

第十三週題目

Travelling Salesman Problem

一個周遊各國的商人，他想去所有不同的城市買賣東西。商人打算從其中一個城市出發，各個地方剛好經過一次、只能經過一次，回到原城市。請規劃出距離最短的路線，以及算出距離。

第十四週題目

背包問題（Knapsack Problem）

假設有一個背包的負重最多可達8公斤，而希望在背包中裝入負重範圍內可得之總價物品，假設是水果好了，水果的編號、單價與重量如下所示： 

0	李子	4KG	NT$4500
1	蘋果	5KG	NT$5700
2	橘子	2KG	NT$2250
3	草莓	1KG	NT$1100
4	甜瓜	6KG	NT$6700

費氏數列

在數學上，費波那契數列是以遞迴的方法來定義：

• 
• 
• （n≧2）

第十五週題目

1.利用遞迴方式寫階乘函數

2.EXCEL表示河內塔(遞迴方式)

參考網站

【演算】河內塔 - Tower of Hanoi

Understanding recursion with the Fibonacci Series

先透過一個簡單的例子，感受一下動態規劃吧！

第十六週題目

viterbi算法：利用动态规划寻找最短路径

[DOC]第十八章：動態規劃(Dynamic model)

密碼學簡介

明文： QUICK BROWN FOX JUMPS OVER  LAZY DOG
密文： TXLFN EURZQ IRA MXPSV RYHU  ODCB GRJ

愷撒密碼（英語：Caesar cipher）找金鑰

RSA加密演算法- 維基百科，自由的百科全書 - Wikipedia

39505874583265144526419767800614481996020776460304936454139376051579355626529450683609
727842468219535093544305870490251995655335710209799226484977949442955603

= 3388495837466721394368393204672181522815830368604993048084925840555281177* x

程式設計求 x 

RSA加密演算法是一種非對稱加密演算法。在公鑰加密標準和電子商業中RSA被廣泛使用。

用實例給新手講解RSA加密算法

http://taichung.iiiedu.org.tw/edm/233-dse344.html

1.加密貨幣介紹
2.加密資產介紹
3.加密貨幣比特幣錢包介紹與操作
4.加密貨幣以太坊錢包介紹與操作
5.加密資產以太坊代幣合約錢包介紹與操作

高中接觸密碼學、大學開始挖礦，北大碩二生：信仰讓我不解套 - 數位時代





理解區塊鏈，不能不知道密碼學- 哈佛商業評論‧與世界一流管理接軌



【心得】有關挖礦的二三事<加密貨幣(Crypto Currency)簡介> @電腦應








密碼學 挖礦




Bitcoin: A Peer-to-Peer Electronic Cash System




Why use Bitcoin?

 離散數學

An Introduction to Programming in Python and Discrete Mathematics 1st Edition
with Python 3

Book

Mathematics for the Digital Age and Programming in Python

試讀章節    函數


What is the Center of Math?

How to Think Like a Computer Scientist: Interactive Edition



註冊並登入

The goal of this book is to teach you to think like a computer scientist. This way of thinking combines some of the best features of mathematics, engineering, and natural science. Like mathematicians, computer scientists use formal languages to denote ideas (specifically computations). Like engineers, they design things, assembling components into systems and evaluating tradeoffs among alternatives. Like scientists, they observe the behavior of complex systems, form hypotheses, and test predictions

Online console from PythonAnywhere

Execute Python Online (Python v2.7.13) 

repl.it - Python3 Compiler, REPL, and IDE


USE OF PYTHON IN TEACHING DISCRETE MATHEMATICS

This paper presented ways to integrate Python programming language into teaching of discrete
mathematics for Computer Science students. Python enables students to readily and instantly
experiment with many of the logic, combinatorial and algorithms concepts typically covered in a
discrete structures course. Ability to experiment to better understand the theory can further
improve student’s problem solving ability as well.


1.瞭解計數的基本原則及常用的組合方法概念
2.瞭解邏輯、函數、集合的數學概念
3.瞭解遞迴及樹的基本概念
4.瞭解數學歸納法及其應用


Videos:

[Discrete Math 2] Permutation and Combination Review

Welcome to Discrete Math 2! The course topics are introduced right at the beginning. In this video, we review permutations, combinations, permutations with repetition, and combinations with repetition. If any of these topics are unclear, please refer to the Discrete Math 1 videos I have uploaded on the channel, or leave a comment below! Visit our website: http://bit.ly/1zBPlvm Subscribe on YouTube: http://bit.ly/1vWiRxW Like us on Facebook: http://on.fb.me/1vWwDRc


Counting and Combinatorics in Discrete Math Part 1

[Discrete Math 1] Introduction to Sets

[Discrete Math 1] Functions - YouTube

[Discrete Math 1] Functions Examples - YouTube

[Discrete Math 1] Introduction to Propositional Logic

[Discrete Math 1] Truth Tables


 Discrete Structures and their Applications 


■ Lectures Slides are posted ahead of time
■ Zybooks reading assignments Help prepare/reinforce lecture
■ Recitations Help you with written/programming assignments Reinforce material from lecture
■ Written/Canvas assignments Do you understand the theory?
■ Programming assignments Can you implement it?
■ Tests What have you learned?

CS 220 Discrete Structures and their Applications 
Computer Science Department
Spring 2018



Mathematics for Computer Science

Discrete Mathematics, SecondEdition In Progress 


Rosen_Discrete_Mathematics_and_Its_Applications_7th_Edition

=======================================================================

We’re here to help you get started.

Step 1: Choose a course

On Code.org, you’ll find courses for all grade levels - from pre-readers to seniors in high school, and everyone in between. All our courses are available at no cost. Looking for a quick activity? Try starting with an Hour of Code.

Step 2: Set up your classroom section

Set up a classroom section to view your student’s progress, print login cards for your students, manage their accounts, and print certificates they can bring home when they finish the course.

Step 3: Start teaching

Try out one of the lessons yourself! We also have daily lesson plans you can use to guide your students, unplugged activities for your class you can do without a computer, and forums to connect to other teachers.

Get started here

Still have questions? Please don’t hesitate to reach out to support@code.org

You’re part of a movement of over 500,000 teachers and over 18 million students that have used Code.org globally, making it the most broadly used coding education platform and computer science curriculum in K-12. Thank you for all you do to give our children the opportunity to build their future.

Best,

Hadi Partovi
Founder, Code.org

Thanks to Microsoft, Facebook, Infosys, Omidyar Network, Google and other generous donors, every student has the opportunity to learn computer science.