一起答
单选

设求解某问题的递归算法如下:    F(int n){        if n==1{            Move(1);        }        else{            F(n-1);            Move(n);            F(n-1);        }    }    求解该算法的计算时间时,仅考虑算法Move所进行的计算为主要计算,且Move为常数级算法,设算法Move的计算时间为k,当n=5时,算法F的计算时间为(42)。

  • A.7k
  • B.15k
  • C.31k
  • D.63k
试题出自试卷《软件水平考试(初级)程序员上午(基础知识)模拟试卷25》
参考答案
查看试卷详情
相关试题
  1. ASCII is a 7-bit code used to represent numeric, alphabetic, and special printable characters. It also includes codes for control characters, which are(75).

    • A.printable or displayable
    • B.not printable or displayable
    • C.not printable but displayable
    • D.printable but not displayable
  2. How many key comparisons are needed in searching for key value 38?(74).

    • A.1
    • B.4
    • C.3
    • D.2
  3. The error messages given by a C compiler show the message text, the most common cause of the error, and a suggestion for(73)the error.

    • A.updating
    • B.fixing
    • C.changing
    • D.Editing
  4. Transport gateways connect byte streams in the transport layer. Application gateways allow interworking above(72).

    • A.network layer
    • B.data link layer
    • C.transport layer
    • D.appfication layer
  5. What is the decimal value of tile binary value 100107(70).

    • A.18
    • B.20
    • C.14
    • D.15
  6. By means of multiple pipeline to carry out multiple processing, this technology is called(71).

    • A.Multiple pipeling
    • B.Superpipeline
    • C.Superscalar
    • D.Very long instruction word
  7. An instruction that uses indrect addressing mustt contain an address of memory where(69).

    • A.data is stored
    • B.a pipeline stall will be executed
    • C.a page fault is addressed
    • D.another address is stored
  8. In which phase of the software engineering process is the Software Requirements Specification developed?(68).

    • A.development phase
    • B.engineering phase
    • C.maintenance phase
    • D.Definition phase
  9. The sorting method described by the code is called(67).

    • A.Insertion sort
    • B.Selection sort
    • C.Radix sort
    • D.Merge sort
  10. In a computer, if a logical left shift of the operand occurs, its lowest bit is(66).

    • A.unchanged
    • B.1
    • C.0
    • D.random