102年 - 102 淡江大學轉學考資訊概論#53068

科目：轉學考-資訊概論 | 年份：102年 | 選擇題數：5 | 申論題數：12

試卷資訊

所屬科目：轉學考-資訊概論

選擇題 (5)

(1) If the memory address space is 16MB and the word size is 8 bits, then_____________bits are needed to access each word. (A) 8 (B) 16 (C) 24 (D) 32

(2) In the_____________method for synchronizing the operation of CPU with the I/O device, a large block of data can be passed from an I/O device to memory directly. (A) programmed I/O (B) interrupt-driven I/O (C) DMA (D) Isolated I/O

(3 )_____________is a protocol for accessing and transferring documents on the WWW. (A) FTP (B) SMTP (C) MINE (D) HTTP

(4) In_____________，the program can be divided into equally sized sections called pages, but the pages need not be in memory at the same time for execution. (A) partitioning (B) paging (C) demand paging (D) demand segmentation

(5) The_____________layer of the TCP/IP protocol suite is responsible for node-to-node delivery of a frame between two adjacent nodes. (A) transport (B) network (C) data-link (D) session

申論題 (12)

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%)

(1) Use the logical right shift on the bit pattern A and the circular left shift on the bit pattern B (2%)

(2) Use the XOR operator on those two bit patterns A and B. (2%)

(3) If A and B are stored in two，s complement format, show how A-B. (3%)

(4) If we need to unset (force to 0) the four leftmost bits of a bit patterns, show the mask and t operation. (3%)

【已刪除】2. Using the selection sort algorithm, manually sort the following list and show your work in eac pass using a table. (10%)

(1) Show the resulting relations if you apply the SQL statements: Select * from COURSES where IJNIT-5. (10%)

(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%

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)

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%)

6. Multiple Choice Questions (10%)