廣東北電的筆試題

才智咖 人氣:2.43W

1.漢譯英

廣東北電的筆試題

電網絡的開發者計劃使來自於不同組織的開發者,能夠在北電網路的'平臺上開發圓滿的補充業務。北電網路符合工業標準的開放介面,為補充業務的開展引入了無數商機,開發者計劃為不同層面的開發者提供不同等級的資格,資格的劃分還考慮到以下因素:補充業務與北電網路平臺的集合程度,開發者團體與北電網路的合作關係,等等。

答:呵呵。這個這個基本上還是不現醜了吧。

2.程式設計

將整數轉換成字串:void itoa(int,char);

例如itoa(-123,s[])則s=“-123”;

答:

char* itoa(int value, char* string)

{

char tmp[33];

char* tp = tmp;

int i;

unsigned v;

char* sp;

// 將值轉為正值

if (value < 0)

v = -value;

else

v = (unsigned)value;

// 將數轉換為字元放在陣列tmp中

while (v)

{

i = v % 10;

v = v / 10;

*tp++ = i+'0';

}

// 將tmp裡的字元填入string指標裡,並加上負號(如果有)

sp = string;

if (value < 0)

*sp++ = '-';

while (tp > tmp)

*sp++ = *–tp;

*sp = 0;

return string;

}

英文筆試題

1. Tranlation (Mandatory)

CDMA venders have worked hard to give CDMA roaming capabilities via the development of RUIM-essentially, a SIM card for CDMA handsets currently being deployed in China for new CDMA operator China Unicom. Korean cellco KTF demonstrated earlier this year the ability to roam between GSM and CDMA using such ver,only the card containing the user’s service data can roam-not the CDMA handset or the user’s number (except via call forwarding).

2. Programming (Mandatory)

Linked list

a. Implement a linked list for integers,which supports the insertafter (insert a node after a specified node) and removeafter (remove the node after a specified node) methods;

b. Implement a method to sort the linked list to descending order.

3. Debugging (Mandatory)

a. For each of the following recursive methods,enter Y in the answer box if themethod terminaters (assume i=5), Otherwise enter N.

static int f(int i){

return f(i-1)*f(i-1);

}

Ansewr:

static int f(int i){

if(i==0){return 1;}

else {return f(i-1)*f(i-1);}

}

Ansewr:

static int f(int i){

if(i==0){return 1;}

else {return f(i-1)*f(i-2);}

}

Ansewr:

b. There are two errors in the following JAVA program:

static void g(int i){

if(i==1){return;}

if(i%2==0){g(i/2);return;}

else {g(3*i);return;}

}

please correct them to make sure we can get the printed-out result as below:

3 10 5 16 8 4 2 1