The purpose of the requirements definition phase is to produce a clear, complete, consistent, and testable _ (1) _ of the technical requirements for the software product.! q% s9 S8 }+ \( o' w* _
During the requirements definition phase, the requirements definition team uses an iterative process to expand a broad statement of the system requirements into a complete and detailed specification of each function..that the software must perform and each _ (2) _ that it must meet. The starting point is usually a set of high level requirements from the _ (3) _ that describe the project or problem.8 ?- T! m0 O7 y% ^
In either case, the requirement definition team formulates an overall concept for the system and then defines _ (4) _ showing how the system will be operated publishes the system and operations concept document and conducts a system concept review (SCR).
) C! [$ s; t/ P+ a Following the SCR, the team derives _ (5) _ requirements for the system from the high level requirements and the system and operations concept. Using structured or object-oriented analysis. the team specifies the software functions and algorithms needed to satisfy each detailed requirement.1 p$ J4 f7 \# L2 P( ^
(1)A.function B.definition C.specification D.statement
# ~- W; g; R, E (2)A.criterion B.standard C.model D.system
- F; @' F( L1 W8 [! F (3)A.producer B.customer C.programmer D.analyser
% U$ b3 M1 F; r) k, e1 s (4)A.rules B.principles C.scenarios D.scenes# |9 ?- c2 ^/ r9 H/ t% V$ |
(5)A.detailed B.outlined C.total D.complete
4 q# s; y- d8 G/ G3 v: a1 S; C' P 参考谜底：C A B C A
4 W# A6 _' T4 t# _# n* Z在分支-限界算法设计策略中，凡是采用_(1)_搜索问题的解空间。7 f, q# { B) z
(1)A.深度优先 B.广度优先" I/ i* \" L: A C, ] ^" [, I
C.自底向上 D.拓扑序列
( F( B# d& ^- Y% p& v) f" Y1 t ●不才列算法设计体例中，_(2)_在求解问题的过程中并不从整体最优上加以考虑，而是做出在当前看来是最好的选择。操作该设计体例可以解决_(3)_问题。9 d, `( |. r- P7 B1 Y
(2)A.分治法 B.贪心法9 G! T& X& f" i! _' p
C.动态规划体例 D.回溯法
9 P7 F% ?/ V6 u; t: Y" O8 ` (3)A.排序 B.检索
- N8 |- m- Y! G5 { F9 Y" I- m6 z* w C.背包 D.0/1背包. y% W( l0 Y* M- q" B3 a
●以关头字斗劲为基本的排序算法在最坏情形下的计较时刻下界为O(nlogn)。下面的排序算法中，最坏情形下计较时刻可以达到O(nlogn)的是_(4)_;该算法采用的设计体例是_(5)_。4 x, Z2 c8 o+ U2 W
(4)A.合并排序 B.插入排序 C.选择排序 D.冒泡排序
3 c1 P% y- W" h8 ?8 z (5)A.分治法 B.贪心法 C.动态规划体例 D.回溯法
- `, h R0 V/ e* S8 x9 U 谜底:B B C A A |
发表于 2012-8-2 09:08:23
