摘要:2016年下半年軟件設(shè)計師考試上午真題第四部分。
>>>【希賽】2016年下半年軟考分?jǐn)?shù)早知道,希賽網(wǎng)解析真題
軟考?xì)v年真題是考生備考的法寶,希賽軟考網(wǎng)整理了2016年下半年軟件設(shè)計師考試真題之上午題,供大家參考學(xué)習(xí)。以下為2016年下半年軟件設(shè)計師上午真題第四部分。
61.以下關(guān)于二叉排序樹(或二叉查找樹、二叉搜索樹)的敘述中,正確的是()
A.對二叉排序樹進(jìn)行先序、中序和后序遍歷,都得到結(jié)點關(guān)鍵字的有序序列
B.含有N個結(jié)點的二叉排序樹高度為[log2n]+1
C.從根到任意二個葉子結(jié)點的路徑上,結(jié)點的關(guān)鍵字呈現(xiàn)有序排列的特點
D.從左到右排列同層次的結(jié)點,’其關(guān)鍵字呈現(xiàn)有序排列的特點
下表為某文件中字符的出現(xiàn)頻率,采用霍夫曼編碼對下列字符編碼,則字符序列“bee”的編碼為(62);編碼::“110001001101”的對應(yīng)的字符序列(63)。
62:
A.10111011101
B.10111001100
C.001100100
D.110011011
63:
A.bad
B.bee
C.face
D.Bace
兩個矩陣Am*n和Bn*p相乘,用基本的方法進(jìn)行,則需要的乘法次數(shù)為m*n*p多個矩陣相乘滿足結(jié)合律,不同的乘法順序所需要的乘法次數(shù)不同??紤]采用動態(tài)規(guī)劃方法確定Mi,M{i+i),…,Mj多個矩陣連乘的最優(yōu)順序,即所需要的乘法次數(shù)最少。最少乘法次數(shù)用m[i,j]表示,其遞歸式定義為:
其中i、j和k為矩陣下標(biāo),矩陣序列中Mi的維度為(Pi-i.)*Pi采用自底向上的方法:實現(xiàn)該算法來確定n個矩陣相乘的順序,其時間復(fù)雜度為(64)。若四個矩陣M1.M2、M3.,M4相乘的維度序列為2、6、3、10.3,采用上述算法求解,則乘法次數(shù)為(65)。
64:
A.O(N2)
B.O(N2Lgn)
C.O(N3)
D.O(n3lgn)
65:
A.156
B.144
C.180
D.360
以下協(xié)議中屬于應(yīng)用層協(xié)議的是(66),該協(xié)議的報文封裝在(67)。
66:
A.SNMP
B.ARP
C.ICMP
D.X.25
67:
A.TCP
B.IP
C.UDP
D.ICMP
68.某公司內(nèi)部使用wB.xyz.com.cn作為訪問某服務(wù)器的地址,其中WB是()。
A.主機名
B.協(xié)議名
C.目錄名
D.文件名
69.如果路由器收到了多個路由協(xié)議轉(zhuǎn)發(fā)的關(guān)于某個目標(biāo)的多條路由,那么決定采用哪條路由的策略是()。
A.選擇與自己路由協(xié)議相同的
B.選擇路由費用最小的
C.比較各個路由的管理距離
D.比較各個路由協(xié)議的版本
70.與地址220.112.179.92匹配的路由表的表項是()。
A.220.112.145.32/22
B.220.112.145.64/22
C.220.112.147.64/22
D.220.112.177.64/22
Software entities are more complex for their size than perhaps any other humanconstruct,because no two parts are alike(at least above the statement level).If they are,wemake the two similar parts into one,a(71),open or closeD.In this respect software systemsdiffer profoundly from computers,buildings,or automobiles,where repeated elements abounD.
Digital computers.are themselves more complex than most things people build;they have very large numbers of states This makes conceiving,describing,and testing them harD.Software systems have orders of magnitude more(72)Likewise,a scaling-up of a software entity is not m erely a repetition of the same elementsm larger size;it is necessarily an mcrease in the number of different elements.In most cases,the elements interact with each other in some(73)fashion:and the complexity of the wholencreases much more than linearly.
The complexity of software is a(an)(74)property,not an accidental one Hencedescriptions of a software entity that abstract away its complexity often abstract away its essence.Mathematics and the physical sciences made great strides for three centuries by constructingsimplified models of complex phenomena,deriving properties fiom the models,and verifyingthose properties experimentally.This worked because the complexities(75)in the modelswere not the.essential properties of the phenomena:It does not work when the complexities are the essence.
Many of the classical problems of developing software products derive from this essential complexi and its nonlinear uicreases with size.Not only.technical problems but management problems as well come from the coin plexity.
71:
A.task
B.job
C.subroitune
D.Program
72:
A.tstates
B.parts
C.conditions
D.Expressions
73:
A.linear
B;nonlinear
C.Parallel
D.Addititive
74:
A surface
B.Outside
C.exterior
D.Essential
75:
A.fixed
B.Included
C.ignored
D.stabilized
>>>返回目錄:2016年下半年軟件設(shè)計師考試真題(上午題)
>>>2016年下半年軟件設(shè)計師考試上午真題答案與解析
相關(guān)推薦:
軟考備考資料免費領(lǐng)取
去領(lǐng)取