(36)不是单元测试主要检查的内容。
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.
已知3个类O，P和Q，类O中定义了一个私有方法F1和一个公有方法F2，类P中定义了一个公有方法F3，类P为类O的派生类，类Q为类P的派生类，它们的继承方式如下所示： class P：pubhc O{…} class Q：Pnvate P{…}在关于类P的描述中正确的是(42)，在关于类Q的描述中正确的是(43)。
外部设备打印机适合于连接到(8)。
一个具有767个节点的完全二叉树，其叶子节点个数为(18)。
在设计测试用例时，(7)是用得最多的一种黑箱测试方法。
若某文件系统的目录结构如图3一16所示，假设用户要访问文件f1．java，且当前工作目录为Program，则该文件的全文件名为(24)，其相对路径为(25)。
已知关系R如表7-4所示，关系R的主属性为(9)，候选关键字分别为(10)。
设T是正则二叉树，有6个叶子结点，那么树T的高度最多可以是(22)；最小可以是(23)；树T的内结点数是(24)。如果T又是Huffman最优树，且每个叶子结点的权分别是1，2，3，45，5，6，则最优树T的非叶子结点的权之和是(25)；权为1的叶子结点的高度是(26)。(注：树的根结点高度为1)
设有关系模式S(Sno，Shame，Pno，Pname，Q，A)表示销售员销售商品情况，其中各属性的含义是：Sno为销售员员工号，Shame为销售员姓名，Pno为商品号，Pname为商品名称，Q为销售商品数目，A为销售商品总金额，根据定义有如下函数依赖集：P={Sno→Sname，Sno→Q，Sno→A，PnoPname}关系模式S的关键字是(66)，W的规范化程度最高达到(67)。若将关系模式S分解为3个关系模式$1(Sno，Shame，Q，A)，$2(Sno，Pno，Pname)，则S1的规范化程度最高达到(68)，S2的规范化程度最高达到(69)。SQL中集合成员资格的比较操作“元组IN(集合)”中的“IN”与(70)操作符等价。
某程序的程序图如图4—15所示，运用McCabe度量法对其进行度量，其环路复杂度是(36)。
多媒体计算机中的媒体信息是指(24)，多媒体技术的主要特性有(25)。目前音频卡具备的功能有(26)。在多媒体计算机中常用的图像输入设备是(27)，国际标准MPEG-2采用了分层的编码体系，提供了4种技术，它们是(28)。
以下不属于ISO/IEC9126软件质量模型第一层特性的是(19)。
When you think of the Internet, you probably think of ".com." Just what do those three letters at the end of a World Wide Web address mean? Every computer that hosts data on the Internet has a 1.______ numerical address. For example, the numerical address for the White House is 198.137.240.100. But since 2._____ people want to remember long strings of numbers, the 3.______ was developed. It is a critical part of the Internet's technical infrastructure, correlates a numerical address to a word. To 4._____ the White House website, you could type its numerical address into the address box of your web browser. But most people prefer to use "www.whitehouse.gov." In this case，the domain name is 5.______ .
分析下列伪码操作，表示所需步骤的函数是(58)。(1)I=1；(2)x=0；(3)while(1＜N)a. x=x+1； b.1=I+1；
某软件公司出资、组织、并安排公司的研发人员具体开发了一套人事方面的管理软件，由该软件公司对开发完成的软件承担责任。该软件的开发者是(21)。
贪婪法是一种(20)的算法。
下列关于软件著作权中翻译权的叙述不正确的是：翻译权是指(10)的权利。
n个顶点的有向完全图中含有向边的数目最多为(23)。
在数据库操作过程中事务处理是一个操作序列，必须具有以下性质：原子性、一致性、隔离性和______。