110年 - 110 國立臺灣大學_碩士班招生考試_生物機電工程學研究所丙組:計算機概論(D)#101168

1.The fornat of IEEE single-precision /loating-point standard representation requires 23 fiaction bits, 8 exponent bits, and I sign bit, with a total of 32 bits for each word. Convert the following binary number in the IEEE single-precision format to its decimal format. (10%)

3. The seven stages in a von Neumann fetch-execute cycle are shown in the table below. Put each stage in the correct sequence by writing the numbers 1 to 7 in the right hand column. (10%)

5. Construct the NFA (nondeterministic finite automaton) transition diagram given the following transition table. (6%)
 Convert the NFA to a DFA (deterministic finite automaton) using the subset construction. (4%)

6. Construct a derivation tree for w = abbbaabbaba using the grammar below. (10%)

9. What is the output of the following C program? (10%)