阿摩線上測驗
登入
首頁
>
轉學考-資訊概論
> 94年 - 94 淡江大學 轉學考 資訊概論#56157
94年 - 94 淡江大學 轉學考 資訊概論#56157
科目:
轉學考-資訊概論 |
年份:
94年 |
選擇題數:
5 |
申論題數:
9
試卷資訊
所屬科目:
轉學考-資訊概論
選擇題 (5)
(1) The digital signature method does not provide ____. (A) Privacy (B) Authentication (C) Integrity (D) Nonrepudiation.
(2) In the ____ method lo synchronize the operation of the 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) DM A (D) Isolated I/O.
(3) A____is a connecting device that acts as a protocol converter. (A) Repeater (B) Bridge (C) Router (D) Gateway.
(4) Defining the users, needs, requirements, and methods is part of the ____ phase. (A) Analysis (B) Design (C) Implementation (D) Testing.
(5) In the ____graphic method of representing an image in a computer, the image is decomposed into a combination of curves and lines. (A) Bitmap (B) Vector (C) Quantized (D) Binary.
申論題 (9)
(1) 012A
h
+0E27
h
.
(2) E12A
h
+9E27
h
.
【已刪除】2. Suppose the procedure Modify is defined by
If parameters are passed by value, what will be printed when the following program segment is executcci? What if parameters are passed by reference? (10%)
X←5;
apply the procedure Modify to X;
print the value of X;
(1) How many pages are used by the first program?
(2) How many pages are unused?
(3) What is the total memory wasted?
4. Using the insertion sort algorithm to sort the list, 7,8, 26, 44, 13, 23,98,57, in increasing order, plcu.sc show, your work briefly. What is the best case for the insertion sort algorithm? What is the worst ease for the insertion algorithm? (15%)
5. A binary tree has 8 nodes. Given the inorder and postorder traversal of the tree, please dr aw the tree.
Postorder: FECHGDBA.
Inorder: FECABHDG.
Draw a diagram showing how this binary tree appears in memory when stored without pointers using a block o! contiguous memory cells. Here assume that each character is encoded by one byte. (20%)
【已刪除】7. Consider the following relations PROFESSORS, COURSES and TAUGHT-BY as shown below. Show the SQL statement that creates a new relation containing the course’s CN, teaching professor’s name, and the place. Please draw the ER diagram for the given relations. (20%)