阿摩線上測驗
登入
首頁
>
轉學考-資訊概論
>
102年 - 102 淡江大學 轉學考 資訊概論#53068
>
7. Show your work to draw the binary search tree whose elements are inserted in the following order: 50, 72, 96, 107, 26, 12, 11,9, 2, 10, 25,51, 16, 17, 95. (15%)
其他申論題
8. Show that a heap storing n entries has height h= Llog nj (10%)
#193064
(1) Use the logical right shift on the bit pattern A and the circular left shift on the bit pattern B (2%)
#193065
(2) Use the XOR operator on those two bit patterns A and B. (2%)
#193066
(3) If A and B are stored in two，s complement format, show how A-B. (3%)
#193067
(4) If we need to unset (force to 0) the four leftmost bits of a bit patterns, show the mask and t operation. (3%)
#193068
【已刪除】2. Using the selection sort algorithm, manually sort the following list and show your work in eac pass using a table. (10%)
#193069
(1) Show the resulting relations if you apply the SQL statements: Select * from COURSES where IJNIT-5. (10%)
#193070
(2) Show the resulting relations if you apply the SQL statements: Select No, Course-name, Ur Professor from COURSES, TAUGHT-BY where COURSES.No= TAUGHT-BY.No. (10%
#193071
4. Show the content of stack SI and the value of variables x and y after the following algorithm segments is executed. (10%) Stack(Sl); push(S 1, 5); push(Sl, 3); push(S 1, 2); If (not empty(Sl)) pop(Sl, x); If(not empty(S 1)) pop(Sl, y); Push(Sl,6)
#193072
5. Find the Huffman tree for the following characters using Huffman coding with the given frequencies: A(12), B(8), C(9), D(20), E(31), F(14), G(8). (15%)
#193073
阿摩線上測驗
登入