軟件設(shè)計師考試科目包括綜合知識與案例分析兩門，為幫助廣大軟考中級軟件設(shè)計師考生更好備考，信管網(wǎng)特整理匯總了軟件設(shè)計師部分綜合知識與案例分析的模擬試題、答案及解析供考生查閱，并提供免費在線模擬答題、歷年真題免費下載等服務(wù)，了解軟件設(shè)計師更多備考信息請關(guān)注信管網(wǎng)。

相關(guān)推薦：

點擊查看/下載：軟件設(shè)計師歷年真題匯總

點擊查看：軟件設(shè)計師在線培訓(xùn)課程 丨 免費試聽課程

免費練習(xí)：軟件設(shè)計師考試題庫(模擬試題、章節(jié)練習(xí)、每日一練)

一、綜合知識：

1、若一臺服務(wù)器只開放了 25 和 110 兩個端口， 那么這臺服務(wù)器可以提供( ) 服務(wù)。

A. E-Mail

B. WEB

C. DNS

D. FTP

信管網(wǎng)參考答案：A

查看解析：m.xiexiliangjiufa.com/st/3955411610.html

2、SNM P 是一種異步請求/響應(yīng)協(xié)議， 采用( ) 協(xié)議進行封裝。

A. IP

B. ICMP

C. TCP

D. UDP

信管網(wǎng)參考答案：D

查看解析：m.xiexiliangjiufa.com/st/3955616061.html

3、在一臺安裝好 TCP/IP 協(xié)議的計算機上， 當(dāng)網(wǎng)絡(luò)連接不可用時， 為了測試編寫好的網(wǎng)絡(luò)程序， 通常使用的目的主機 IP 地址為( ) 。

A. 0.0.0.0

B. 127.0.0.0

C. 10.0.0.1

D. 210.225.21.255/24

信管網(wǎng)參考答案：B

查看解析：m.xiexiliangjiufa.com/st/395571096.html

4、測試網(wǎng)絡(luò)連通性通常采用的命令是( ) 。

A. Nestar

B. Ping

C. Mscinfug

D. Cmd

信管網(wǎng)參考答案：B

查看解析：m.xiexiliangjiufa.com/st/395589159.html

5、The development of the Semantic Web proceeds in steps, each step building a layer on top of another. The pragmatic justification for this approach is that it is easier to achieve (1) on small steps, whereas it is much harder to get everyone on board if too much is attempted. Usually there are several research groups moving in different directions; this (2) of ideas is a major driving force for scientific progress. However， from an engineering perspective there is a need to standardize. So, if most researchers agree on certain issues and disagree on others, it makes sense to fix the point of agreement. This way, even if the more ambitious research efforts should fai1， there wil1 be at least(3) positive outcomes.

Once a (4) has been established ， many more groups and companies will adopt it， instead of waiting to see which of the alternative research lines will be successful in the end. The nature of the Semantic

Web is such that companies and single users must build tools， add content，and use that content. We cannot wait until the full Semantic Web vision materializes-it may take another ten years for it to be realized to its full(5) (as envisioned today, of course).

(1).A. conflicts

B. consensus

C. success

D. disagreement

(2).A. competition

B. agreement

C. cooperation

D. collaboration

(3).A. total

B. complete

C. partial

D. entire

(4).A. technology

B. standard

C. pattern

D. model

(5).A. area

B. goal

C. object

D. extent

信管網(wǎng)參考答案：B、A、C、B、C

查看解析：m.xiexiliangjiufa.com/st/3956029197.html

二、案例分析：

閱讀下列說明和c代碼，將應(yīng)填入 處的字句寫在對應(yīng)欄內(nèi)。

【說明】

棧(stack)結(jié)構(gòu)是計算機語言實現(xiàn)中的一種重要數(shù)據(jù)結(jié)構(gòu)。對于任意棧，進行插入和刪除操作的一端稱為棧頂(stock top)，而另一端稱為棧底(stock bottom)。棧的基本操作包括：創(chuàng)建棧(newstack)、判斷棧是否為空(isempty)、判斷棧是否已滿(isfull)、獲取棧頂數(shù)據(jù)(top)、壓棧/入棧(push)、彈棧/出棧(pop)。

當(dāng)設(shè)計棧的存儲結(jié)構(gòu)時，可以采取多種方式。其中，采用鏈?zhǔn)酱鎯Y(jié)構(gòu)實現(xiàn)的棧中各數(shù)據(jù)項不必連續(xù)存儲(如下圖所示)。

以下c代碼采用鏈?zhǔn)酱鎯Y(jié)構(gòu)實現(xiàn)一個整數(shù)棧操作。

【c代碼】

typedef struct list {

int data; //棧數(shù)據(jù)

struct list* next; //上次入棧的數(shù)據(jù)地址

}list;

typedef struct stack{

list* ptop; //當(dāng)前棧頂指針

}stack;

stack* newstack() {return (stack*) calloc(1/sizeof(stack));}

int isempty(stack* s){//判斷棧s是否為空棧

if( (1) )return 1;

return 0;

}

int top(stack* s){//獲取棧頂數(shù)據(jù)。若棧為空，則返回機器可表示的最小整數(shù)

if(isempty(s))return int_ min;

return (2) ;

}

void push(stack* s，int thedata) {//將數(shù)據(jù)thedata壓棧

list* newnode;

newnode=(list*)calloc(1/sizeof (list));

newnode->data=thedata;

newnode->next=s->ptop;

s->ptop= (3) ;

}

void pop(stack* s) {//彈棧

list* lasttop;

if(isempty(s) ) return;

lasttop=s->ptop;

s->ptop= (4) ;

free(lasttop);

}

#define md(a) a<<2

int main(){

int i;

stack* mystack;

mystack= newstack();

push(mystack，md(1));

push(mystack，md(2));

pop(mystack);

push(mystack，md(3)+1);

while( !isempty(mystack) ){

printf("%d"，top(mystack));

pop(mystack);

}

return 0;

}

以上程序運行時的輸出結(jié)果為： (5)

查看答案與解析：m.xiexiliangjiufa.com/st/245685491.html