以下是政大的考古题一部分 因为没有解答所以我不知道解的对不对 请各位大大帮我看一下吧^^ 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)