[試題] 100上 周承復 計算機概論 期末考
課程名稱︰計算機概論
課程性質︰選修
課程教師︰周承復
開課學院：電機資訊學院
開課系所︰資工系
考試日期（年月日）︰2012.1.9
考試時限（分鐘）：180分
是否需發放獎勵金：是
（如未明確表示，則不予發放）
試題 :
1. (10%)
a) Pleasa explain two different schemes: N-Unicast and Multicast, which are
used to implement the Internet Radio.
b) What are some distinctions between UDP and TCP?
2. (15%) Modify the HTML document below so that the word "Rover" is linked to
the document whose URL is http://animals.org/pets/dogs.html .
<html>
<head>
<title>Example</title>
</head>
<body>
<h1>My Pet Dog</h1>
<p>My dog's name is Rover.</p>
</body></html>
3. (20%)
a) What sequence of numbers would be printed if the procedure named xxx
as described below were executed with the value of N being 2?
procedure xxx (N) procedure yyy (N)
print the value of N; print the value of N;
if (N < 3 ) apply the procedure xxx to the value 5;
the (apply procedure yyy print the value of N;
to the value 4);
print the value of N;
b) The following procedure was designed to compute the largest integer
whose square is no greater than N, where N is assumed to be a positive
number. (If N is 5, then the procedure should report the value 2.) Find
and correct the error.
procedure squareroot (N)
X <-- 0;
while (x^2 <= N) do
(X <-- X + 1);
report the value of X;
4. (10%) Please recall the "Tower of Hanoi" and its game rules that we
mentioned in Homework 4. Now, there's another approach:
The pegs are arranged on a circular stand (with a peg mounted at each of
the positions of 4, 8, 12 o'clock, like following picture). The rings
(which begin on one of pegs) are numbered from the smallest one as 1, 2,
3, ..., and so on. Odd-numvered rings are allowed to move clockwise to
the next peg. Even-number rings are allowed to move counterclockwise.
Under these rules, always move the largest-numbered ring that is movble.
Please develop a NON-recursive algorithm for solving the type of the
"Towers of Hanoi."
5. (30%) Transition Process in Programming Language
a) What are the major steps in the translation process?
b) Draw the parse tree for the expression x*y+z/x+y based on the syntax
diagrams in Appendix.
c) Show that the grammer below is ambiguous by drawing two distinct parse
treesfor the string "drip drip drip".
Leak:
------> Leak -----> drip ----- Leak ---------->
| | | |
|___________| |_____________|
6. (15%) Logical Deduction
Is the collection of statements consistent?
~R, ( T or R ), ( P or ~Q ), ( Q or ~T ) and ( R or ~P )
Please draw a diagram (like what we did in the class) to explain your answer.
7. (20%)SQL
a) Given the two relations X and Y below
X: A B Y: C D
2 s t 1
5 z r 3
w 2
Draw the relation Rule that would be produced by the statement:
Temp <-- JOIN X and Y where X.A > Y.D
RESULT <-- PROJECT X.B, Y.C from Temp
b) Translate the following query into one SQL statement.
Temp <-- SELECT from X where A = B
Result <-- PROJECT A, C from Temp
8. (10%) Hash & Data Integrity
a) Suppose you were going to construct a hash fule with 20 to 25 buckets
using the division hash function discussed in the textbook. How many
buckets should you actually use?
b) List and explain 3 different schemes, which within a DBMS are used to
maintain database integrity.
--
※ 發信站: 批踢踢實業坊(ptt.cc)
◆ From: 140.112.30.99
→
01/09 13:51, , 1F
01/09 13:51, 1F
→
01/09 18:11, , 2F
01/09 18:11, 2F
推
01/15 22:25, , 3F
01/15 22:25, 3F