義守大學 98 學年度研究所碩士在職專班考試試題
系所別
資訊工程學系
考試科目
計算機概論
考試日期 98/4/18
總頁數
3
※此為試題卷，請將答案填寫在答案卷內，未寫於答案卷內者，不予計分。
※不可使用計算機
第一大題：單選題，共計四十分，每答對一題得二分，答錯不倒扣。
1. How many symbols can be represented by a bit pattern with 10 bits?
(A) 128 (B) 256 (C) 512 (D) 1024
2. When you want to download music to a computer, the audio signal must be
(A) sampled (B) quantized (C) coded (D) all of the above
.
number representation, then the decimal number is
3. If the leftmost bit is 0 in
positive.
(A) sign-and-magnitude (B) one’s complement
(C) two’s complement
(D) all of the above
4. The precision of the fractional number stored in a computer is defined by the
(A) sign (B) exponent (C) mantissa (D) any of the above
operator, if the input is two 1s, the output is 0.
5. For the binary
(A) AND (B) OR (C) XOR (D) all of the above
6.
is a unit that can add two inputs.
(A) An ALU (B) A register (C) A control unit (D) A tape drive
7.
is a memory type with capacitors that need to be refreshed periodically.
(A) SRAM (B) DRAM (C) ROM (D) All of the above
controller is a high-speed serial interface that transfers data in packets.
8. The
(A) SCSI (B) FireWire (C) USB (D) IDE
method to synchronize the operation of the CPU with the I/O device, a
9. In the
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
layer of the OSI model is responsible for source-to-destination delivery of
10. The
an individual packet.
(A) transport (B) network (C) data-link (D) session
, the program can be divided into equally sized sections called pages, but the
11. In
pages need not be in memory at the same time for execution.
(A) partitioning (B) paging (C) demand paging (D) demand segmentation
備註：試題隨答案卷繳交
第1頁
義守大學 98 學年度研究所碩士在職專班考試試題
系所別
資訊工程學系
考試科目
計算機概論
考試日期 98/4/18
總頁數
3
※此為試題卷，請將答案填寫在答案卷內，未寫於答案卷內者，不予計分。
※不可使用計算機
12. Which topology uses a hub or switch?
(A) bus (B) ring (C) star (D) all of the above
13.
is a protocol for file transfer.
(A) FTP (B) SMTP (C) TELNET (D) HTTP
and a
.
14. The complier consists of a
(A) preprocessor; loader (B) text editor; loader
(C) preprocessor; translator (D) linker; preprocessor
15. In the system development process, pseudo-code is a tool used in the
(A) analysis (B) design (C) implementation (D) testing
16.
phase.
is an ordered collection of data in which each element contains the location of
the next element.
(A) An array (B) A record (C) A linked list (D) A node
17. If s1 is the first data element input into a stack followed by s2, s3 and s4,
first element to be removed.
(A) s1 (B) s2 (C) s3 (D) s4
is the
18. When a hashing algorithm produces an address for an insertion key and that address
.
is already occupied, it is called a
(A) collision (B) probe (C) synonym (D) linked list
19. If you have tuples in a relation containing student information and want only the tuples
operation.
of the female students, you can use the
(A) project (B) join (C) update (D) selection
20.
is a lossy compression method for pictures and graphics; whereas
lossy compression method for video.
(A) DCT; MPEG (B) MPEG; JPEG (C) JPEG; MPEG (D) JPEG; DCT
第二大題：問答題，共計四十分。
21. Briefly explain the following terms: (20%)
(a) Time Complexity
(c) Data Mining
(e) Low-Pass Filter
備註：試題隨答案卷繳交
(b) Image Enhancement
(d) Online Game
第2頁
is a
義守大學 98 學年度研究所碩士在職專班考試試題
系所別
資訊工程學系
考試科目
計算機概論
考試日期 98/4/18
總頁數
3
※此為試題卷，請將答案填寫在答案卷內，未寫於答案卷內者，不予計分。
※不可使用計算機
22. Suppose that an array with 6 rows and 8 columns is stored in row–major order
starting at address 20 (decimal). If each entry in the array requires only one memory
cell, what is the address of the entry in the third row and fourth column? (5%)
23. Given preorder─CADEHBFGI and inorder─DAHEBCFIG for a binary tree, draw the
result of postorder traversal. (5%)
24. What is the result printed by the following program? (10%)
(a) program A
sum := 0;
for a := 1 to 2 do
for b := 1 to 3 do
sum := sum + a;
end
end
output sum;
end program
(b) program B
y := 0;
while y<=3 do
x := y;
while x>0 do
output ‘#’;
x := x – 1;
end while
output y;
y := y + 1;
end while
end program
第三大題：程式設計題，每題十分，共計二十分。可使用 BASIC、PASCAL、
FORTRAN、C、C++、MATLAB 或 Java 程式語言，擇一作答。
25. Write a program that will print the result of 1×3+2×4+3×5+ … +98×100.
26. The Fibonacci sequence is (0,1,1,2,3,5,8,13, …). Write a program that displays the nth
number in the Fibonacci sequence, where n is interactively entered into the program
by the user.
備註：試題隨答案卷繳交
第3頁