Re: [理工] [資結]-台科資結(核對)
※ 引述《tool11 (:))》之銘言：
: 1.Use quicksort to sort the following array in ascending, show the results
: pass by pass.
: Original anay: 51,41, 11, 31,91, 71, 81, 61,21.
: pass1 [41 11 31] 51 [91 71 81 62]
: pass2 [11 31 ] 41 51 [91 71 81 62]
: pass3 11 31 41 51 [71 81 62] 91
: pass4 11 31 41 51 [81 62] 71 91
: pass5 11 31 41 51 62 71 81 91
: 這些過程 不知正確與否
: 2.Given an infix: "(A+B)*(C+D-E)*F", please find the related binary tree, and
: its prefix and postfix by using traversal.
: 前序 AB+CD+E-F**
: 後序 **+AB-+CDEF
: 圖的地方 就劃不出來了 以中序來說
: +
: / \
: A B
: 這地方 OK 下一步 就不知道 從哪下手了
*
/ \
* F
/ \
+ -
/ \ / \
A B + E
/\
C D
: 3.What is the largest value that can be represented in a floating-point
: system in which each value is encoded by a byte whose most significant
: bit is the sign bit, the next three bits represent the exponent
: field in excess notation, and the last four bits represent the mantissa?
: 這題找了答案 7.5
: 有點不懂
: 一些書 也沒針對這解釋
: 拜託 大家了 謝謝^^
0 111 1111
sing exponent mantissa
(7-4) 3 -1 -2 -3 -4
+ 2 * 0.1111 = 2 *(2 + 2 + 2 + 2 ) = 7.5
應該是這樣吧..
--
※ 發信站: 批踢踢實業坊(ptt.cc)
◆ From: 219.71.13.143
討論串 (同標題文章)
完整討論串 (本文為第 1 之 2 篇)：