阿摩線上測驗
登入
首頁
>
交大◆資工◆線性代數與離散數學
>
104年 - 104 國立交通大學_碩士班考試入學試題_資訊聯招:線性代數與離散數學#113284
> 申論題
題組內容
3. In the following questions, just give the answer, do not give any explanation.
(b) (3 points) What is the largest value of n for which K
n
(a complete graph on n vertices) is planar?
相關申論題
(c) (3 points) If the permutations of 1,2,3,4,5,6 are written in lexicographic order, with 123456 in position #1, 123465 in position #2, etc., find the permutation in position #484.
#484115
(a) (4 points) an, = the number of bit strings of length n with an even number of 0s. Describe the sequence recursively. Include initial condition and assume that the sequence begins with a1.
#484116
(b) (4 points) Find the number of ways in which nine identical blocks can be given to four children, if the oldest child gets at most three blocks.
#484117
(c) (4 points) Suppose A is a set with n symbols, IAI = n. Find the number of symmetric binary relations on A.
#484118
(d) (4 points) How many non-isomorphic simple undirected graphs with 5 vertices and 3 edges?
#484119
(a) (2 points) Which statements are always false?
#484120
(b) (2 points) Which statements are al ways true?
#484121
(c) (2 points) Which statements are equivalent to the statement (B)?
#484122
(d) (2 points) What does the statement (L) imply about L?
#484123
6. (5 points) Assume A, B, and C are respectively m✕p, p✕q, and q✕n matrices, and M = ABC. Let Mkl = akcl for 1 ≤ k ≤ p and 1 ≤ l ≤ q, here ak and cl respectively denote the k-th column vector of A and the I-th row vector of C. Prove that
#484124
相關試卷
104年 - 104 國立交通大學_碩士班考試入學試題_資訊聯招:線性代數與離散數學#113284
104年 · #113284