若L(x, y)表示"x loves y", 請用quantifier 來表示這個句子"There is somebody whom everybody loves."
∃x ∀y L(x, y)
∀y ∃x L(y, x)
∃x ∀y L(y, x)
∀y ∃x L(x y)
P(S)表示S 這個集合的Power Set. 若S = {0, ∅, {0, ∅}}, 則P(S)包含幾個元素?
3
4
6
8
以下敘述何者錯誤?
2n+1 is O(2n)
n! is O(2n)
log2n is O(n)
log n! is O(n log n)
A palindrome is a string whose reversal is identical to the string. How many bit strings of length n are palindromes? (Let n be an odd integer)
2n
C(n, (n + 1)/2)
n2
以下relation 那一個不是transitive? (令x, y ∈ Z)
{(x, y) | xy ≥ 1}
{(x, y) | x = y + 1 or x = y − 1}
{(x, y) | x ≥ y2}
{(x, y) | x ≡ y (mod 7)}
How many relations are there on the set {a, b, c, d}
256
16
64
65536
How many edges does the graph Qn has (Qn 是一個n-Cube)?
2n ⋅ (n − 1)
n2
2n−1 ⋅ n
Which of the following graphs has an Euler circuit? (Kn : complete graph, Wn : wheel, Qn : n-cube)
K7
W4
K6
Q3
由a, b, c 三個字元所構成, 且長度為10的子串中, 恰包含3個a 或恰包含4個b的字串共有多少個?
24600
330
210
12460
以下各個函數(f : Z × Z → Z)那一個不是映成(onto)函數?
f(x, y) = x + y
f(x, y) = x
f(x, y) = |x| − |y|
f(x, y) = x2 − y2
利用數學歸納法證明:
A 是bit strings 所構成的集合, 其recursive definition 如下 :
(0 ∈ A), if (x ∈ A) then (x0 ∈ A ∧ 1x ∈ A) (其中x0 表示字串x 與0 連接)。請問集合A 中長度為4 的字串有那些?
Use structural induction to show that n(T) ≥ 2h(T) + 1, where T is a full binary tree.(n(T)表示node number, h(T)表示tree 的高度)
假設集合S 有n 個元素. 則總共有多少個可能的ordered pairs (A, B), A ⊆ S, B ⊆ S, 而且A ⊆ B? (Hint: 考慮S 的任一個元素可能在A, B − A, 或S − B 中)
一個relation R 假設我們用以下的矩陣W0 來表示
請模擬Warshall's Algorithm 來求取R 的transitive closure
一個relation R 假設我們用以下的矩陣W0 來表示
Warshall's Algorithm 的Time Complexity 為何?
Find a recurrence relation for the number of bit strings of length n that do not contain three consecutive 0s. (在此我們用an 代表長度是n, 且符合這個條件的string 個數)
a1, a2, a3 與a4 的值各為何?
我們必須任意選出幾個整數, 才能確定其中有兩個數a, b 符合a ≡ b (mod 3)而且 a ≡ b (mod 7)?
假設T(n)的recurrence relation 為T(n) = 4T(n/2) + n, 則T(n)函數的複雜度(Θ)為何?
可觀看題目詳解,並提供模擬測驗!(免費會員無法觀看研究所試題解答)