2012年软件水平考试软件设计笔试考前练习(5)' u* Q4 v0 i7 q
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./ w% `( Q4 Z/ ?7 _
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.
( c( M/ E) W5 C, `. o9 g0 o# P' r 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).
. j k3 d; }2 ~% ? 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.$ f7 p1 b: P' c8 W7 V1 ?+ \
(1)A.function B.definition C.specification D.statement
6 g# G# L* W) B (2)A.criterion B.standard C.model D.system
+ n. \0 K6 W6 I5 C( c$ ? T (3)A.producer B.customer C.programmer D.analyser
1 m0 b6 c$ ]* ] (4)A.rules B.principles C.scenarios D.scenes# F- J& ^! ?& N" t
(5)A.detailed B.outlined C.total D.complete8 p' u6 D7 \: M) ]& R
参考答案：C A B C A
' ]% K: f! D: K: n0 N" ^5 K9 K. F在分支-限界算法设计策略中，通常采用_(1)_搜索问题的解空间。* z4 Q' F) B3 u) X* U8 X7 M
(1)A.深度优先 B.广度优先
) ^" W! ]) b Y7 C! l6 {0 T) j1 n9 g C.自底向上 D.拓扑序列
- ~% c/ K- g8 c5 m! R ●在下列算法设计方法中，_(2)_在求解问题的过程中并不从整体最优上加以考虑，而是做出在当前看来是最好的选择。利用该设计方法可以解决_(3)_问题。, y3 v: c$ m; f; _1 a {# O
(2)A.分治法 B.贪心法& i! {8 ]# v$ H2 `1 i
C.动态规划方法 D.回溯法5 h8 T" C" \- m; h% F# u
(3)A.排序 B.检索
6 r/ C6 }+ n7 q j4 o C.背包 D.0/1背包
: L, |' q4 e& D( b% m ●以关键字比较为基础的排序算法在最坏情况下的计算时间下界为O(nlogn)。下面的排序算法中，最坏情况下计算时间可以达到O(nlogn)的是_(4)_;该算法采用的设计方法是_(5)_。
$ D, U- c" o, U; ]' R5 l6 x& c% [ (4)A.归并排序 B.插入排序 C.选择排序 D.冒泡排序
( y1 M' [( [; A (5)A.分治法 B.贪心法 C.动态规划方法 D.回溯法
( `) `) L# g0 k: l, ? 答案:B B C A A |
发表于 2012-8-2 09:08:23
