Re: [問題]考古題
※ 引述《bill790602 (REBORN)》之銘言：
: 1.what is the Excess_128 representation of 5?
: (a)00000101(b)10000100(c)10000101(d)10000001
超128就是加128...
(5+128)10=(10000101)2
答案為c
: 2.Change the decimal number-124 to an 8-bittwo's complement integer
(-124)10用8bits，2的補數來表示
(124)10=(1111100)2 轉2的補數為(0000100)2
答案為10000100
: 3.An alogorithm of complexity O(n log n)is not as efficient as one of order
: (a)O(logˇ2n)(b)O(n^2 )(c)O(2^n )(d)O(n√n)(e)n^(log_(2^n ) )
答案為d 這...是數學問題嗎...
: 4.Can you draw a binary tree from the following prefix and infix traversal
: order?If yes,draw the tree.If not,state your reason
: Prefix:D B A C I E H
: Infix:A B H C D E I
Prefix的D在B的左子樹~~
Infix的D在A的右子樹階層中~~
應該是畫不出來吧....
: 5.We have an integer array foo[3][7]in a C program. Assume that each integer
: is Stored in two bytes.The array is stored in row-major order .If foo[0][0] is
: stored at 0x200,where is foo[2][3]?
0x200是(200)16...
f00[2][3]=f[0][0]+[(2-0)*7+(3-0)]*2
=200+(34)10=200+22=222
答案為0x222
//解釋到一半發現我寫錯了XD....以上更正
陣列的儲存方式有兩種~~row-major和column-major
row-major的內部結構就是
xxxxxxx
xxxxxxx ->一列一列存，存完一列再存下一列
xxx'x'
column-major則是
xxx
xxx
xxx
xxx
xx ->一行一行存，存完一行再存下一行
xx
xx
第一個x是f[0][0] 它的位址是0x200(16進制的200)
問你f[2][3]就是row-major的'x'的位址
那先算前面幾個x-->2*7+3=17
一個x的大小是2byte-->17*2=34 轉16進制=22
0x200+22=0x222
: 6x.What are the three main features of Object-Oriented
: Programming Language?
封裝、繼承、多型
: 麻煩各位大大了~
: 小弟遇到瓶頸ˊˋ
請前輩多多指教!!!!^-^
--
※ 發信站: 批踢踢實業坊(ptt.cc)
◆ From: 125.230.19.161
推
06/28 09:54, , 1F
06/28 09:54, 1F
※ 編輯: castin 來自: 125.230.19.161 (06/28 11:01)
→
06/28 15:40, , 2F
06/28 15:40, 2F
討論串 (同標題文章)