问题 配伍题 B1型题

对于合并二尖瓣狭窄的产妇,剖宫产过程中出现血压下降,首选()。
对于无心肺并发症的产妇,剖宫产过程中出现血压下降,首选()。

A.麻黄碱

B.去甲肾上腺素

C.去氧肾上腺素

D.缩宫素

E.多巴胺

答案

参考答案:C,C

解析:剖宫产过程中若出现低血压,应积极补充液体,子宫左倾,而血管加压药亦可取得良好的效果,麻黄碱和去氧肾上腺素均可纠正低血压,但前者可增加胎儿败血症的发生率,如果产妇心率不慢应首选去氧肾上腺素。而对于合并二尖瓣狭窄的产妇,小剂量、分次给予去氧肾上腺素有助于维持外周血管阻力,又不至于引起母体心动过速,是优于麻黄碱的升压药,第2小题选C。

选择题
单项选择题

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.

(71)处填()。

A.implement

B.pattern

C.tool

D.model