作者katsuoli (katsuo)
看板TransCSI
标题[问题] 高雄大学95计概3,4 96计概4,6,8
时间Tue Jun 30 18:00:34 2009
http://www2.nuk.edu.tw/lib/exam/95/trans2/95cs(2)-trf.pdf 95年计概
http://www2.nuk.edu.tw/lib/exam/96/trans2/96cs(2)-trf.pdf 96年计概
九五年计概
3.
Suppose that a list L of 8 integers 12,5,13,7,9.14,4,8 are given.
Please design a computing method (or algorithm) that determines
if an integer k exists in L . Return the position of k if it is found
in L and -1 otherwise. State your algorithm in pseudocode or C/C++/Java.
这我题我看不太懂题目，是要在这八个整数中找一个k的位址吗?
"L and -1 otherwise." 不懂意思。
4.
Let A下标(m*n) and B下标(n*m) be two matrixes.
Please write a pseudocode to compute A(m*n)xB(n*m)
这应该是矩阵乘法，我以前有写过.....详细步骤我忘了
我记得要先定义矩阵 然後 交换? 可是m*n没有实际数字的矩阵要怎麽定义?
另外有人可以交我BBS的上下标要怎麽输入吗？
九六年计概
4. In C language, “&”, “|”, and “~” are bitwise AND, bitwise OR,and one
’s complementoperators, respectively.
Let x be an unsigned int in C. (a) Write an if-statement that checks
whether bits 0, 5, 6 of x are all 1’s using one of these operators. (5%) (b)
Write an if-statement
that checks whether any of the bits 0, 5, 6 of x is 1 using two of these
operators.
题意看不太懂？ 这题是问怎样用1的补数表示吗？ 感觉不太像
6.Write a function in C or Java that right rotates the contents of a given
integer array. For example,
if A = {45, 23, 11, 87, 4, 6, 26, 10}, then we have A = {10, 45, 23, 11, 87,
4, 6, 26} after it has been right rotated.
看不懂题目， right rotated我google没看到比较像的 ?
8.Let C(n, k) denote the number of ways to select k out of n items without
order. It is known that
C(n ,1) = n, C(n, n) = 1, and C(n, k) = C(n-1, k-1)+C(n-1, k). Please write a
recursive function
comb(int n, int k) that computes C(n ,k) based on the above-mentioned
knowledge
这也看不懂，好像是排列组合问题?
问题很多，麻烦各位了。
--
※ 发信站: 批踢踢实业坊(ptt.cc)
◆ From: 118.167.169.139
1F：推 future1234:3. L指的就是list , "-1" 就是找不到要回传的值 06/30 18:10
2F：→ future1234:4.如果A(m*n)是 A[m][n] ,C[m][m] = A[m][n] x B[n][m] 06/30 18:15
3F：推 future1234:6.感觉是把最後一个拉到最前面的位置, 其它後退.... 06/30 18:26
4F：推 avogau:6.题目写的很清楚 把最右边的放到最左边 其他像右shift 06/30 18:26
5F：→ future1234:8.感觉好像少了个终止条件 C(n,0) = 1 06/30 18:28