A machine’s ONLYQ

C is sometimes referred to as a 'high -level(66)language'. Some people think that's an insult, but it's actually a deliberate and significant aspect of the language. If you have(67)in assembly language, youll probably find C very natural and comfortable(although if you continue to focus too heavily on machine - level details, youll probably end up with unnecessarily non- portable programs). If you havent programmed in assembly language, you may be frustrated by C 's lack of certain higher - level features. In either case, you should understand why C was de- signed this way: so that seemingly - simple constructions expressed in C would not expand to arbitrarily expensive( in time or(68))machine language constructions when(69). If you write a C program simply and succinctly, it is likely to result in a succinct, efficient machine language executable. If you find that the(70)resulting from a C program is not efficient, it's probably because of something silly you did, not because of something the compiler did behind your back which you have no control over. In any case, there's no point in complaining about C's low - level flavor: C is what it is.

A．assembly

B．combination

C．grouping

D．compounding

A、high-level languages

B、machine language

C、human languages

D、assembly language

The Turing machine is an abstract(71)of computer execution and storage introduced in 1936 by Alan Turing to give a mathematically precise definition of(72). or 'mechanical procedure'. As such it is still widely used in theoretical computer science, especially in(73)theory and the theory of computation. The thesis that states that Turing machines indeed capture the informal notion of effective or mechanical method in logic and mathematics is known as Turing's thesis.

Every Turing machine computes a certain(74)partial function over the strings over its alphabet. In that sense it behaves like a computer with a fixed program. However, as Alan luring already described, we can encode the action table of every Turing machine in a string. Thus we might try to construct a Turing machine that expects on its tape a string describing an action table followed by a string describing the input tape, and then computes the tape that the encoded Turing machine would have computed. As Turing showed, such a luring machine is indeed possible and since it is able to simulate any other Turing machine it is called a(75)Turing machine.

A universal Turing machine is Turing complete. It can calculate any recursive function, decide any recursive language, and accept any recursively enumerable language. According to the Church-Turing thesis, the problems solvable by a universal Turing machine are exactly those problems solvable by an algorithm or an effective method of computation, for any reasonable definition of those terms.

A．implement

B．pattern

C．tool

D．model

A.10.76.0.1

B.127.0.0.1

C.192.168.0.1

D.255.255.255.0

A、使用了虚拟化技术后，一台Guest Machine可以同时使用多台Host Machine的资源

B、使用了虚拟化技术后，一台Guest Machine只能运行在创建它的Host Machine上

C、使用了虚拟化技术后，一台Host Machine只能运行一个Hypervisor

D、使用了虚拟化技术后，一台Host Machine上能够运行多台Guest Machine