以下是政大的考古題一部分
因為沒有解答所以我不知道解的對不對
請各位大大幫我看一下吧^^
1.True or False
T (a)Memory access is the slowest step in the instruction fetch-execute cycle
F (b)Thrashing is caused by the creation of multiple threads in a process
F (f)A "While"loop body must be executed at least one time
T (j)A Turing machine can store information in and retrieve it from memory
T (c)The size of virtual memory is not bounded by the size of physical memory
2.Expression and variable evaluation
(a)If originally x=3,what is the value of x after the evaluation of the
expression(x+=x+3) 答案是9嗎?
(b)Given a=3,b=4,c=5.what is the resulting value of the
expression(-a*(3+b)/2-c++*b)?What are the new values of a,b,c?
我算第一個是-30.5 第二小題a=3,b=4,c=6
(c)If originally x=3,y=2,z=1,what the value of x,y,z after executing the
following code?
if (z=x<y)
{
x+=3;
y-=1; A:x=2,y=3,z=1
}
else
x=y++;
以下這幾題是不太會的
What condition indicates that a circular queue is full?
What condition indicates that a linkes tree in a machine's memory is empty?
Consider the recursive paradigm in a computational algorithms
(a)What is the typical structure of recursive functions?
(c)What are the potential problems in using recursive functions?
How the problem can be reduced?
--
--
※ 發信站: 批踢踢實業坊(ptt.cc)
◆ From: 218.34.243.63
※ 編輯: pboywc 來自: 218.34.243.63 (05/04 22:19)