- 1.
If A = {x, a, b, c, d}, how many closed binary operations on A have x as the identity?
- 題型：問答題
- 難易度：尚未記錄
- 2.
Use a C-like language to write recursive algorithm to generate all the staircase paths from (x0, y0) to (x1, y1) one and only once.
- 題型：問答題
- 難易度：尚未記錄
- 3.
Determine the number of staircase paths from (0, 8, 1) to (7, 4, 9).
- 題型：問答題
- 難易度：尚未記錄
- 4.
Analyze the number of iterations in the following loops. for (i = 1; i <= 80; i += 4) for (j = 1; j <= i; j += 2) for (k = 1; k <= j; k++) {printf("\n");}
- 題型：問答題
- 難易度：尚未記錄
- 5.
In how many ways can we distribute 8 red balls and 9 blue balls among 6 children so that each child receives at least one blue ball?
- 題型：問答題
- 難易度：尚未記錄
- 6.
For finite sets A and B with |A| = m and |B| = n, determine the number of functions and onto function from A to B.
- 題型：問答題
- 難易度：尚未記錄
- 7.
Prove: generalized DeMorgan's law.
- 題型：問答題
- 難易度：尚未記錄
- 8.
Prove: A → B ∨ C = (A ∧ ¬B → C) and A ∨ B → C = (A → C) ∧ (B → C).
- 題型：問答題
- 難易度：尚未記錄
- 9.
Prove: for all n ≥ 14, n can be written as a sum of 3's and/or 8's.
- 題型：問答題
- 難易度：尚未記錄