DOC《广东北电面试题》

??} ??LNode?*pDel?=?NULL;

????//?删除节点 ??pDel?=?pTemp->next;

??pTemp->next?=?pDel->next;

??delete?pDel;

??m_listLength--;

??return?true;

} //sort the linked list to descending order. void?LinkList::sort() { ??if?(m_listLength?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 cards.However,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 中文笔试题 1.汉译英 北电网络的开发者计划使来自于不同组织的开发者,能够在北电网络的平台上开发圆满的补充业务.北电网络符合工业标准的开放接口,为补充业务的开展引入了无数商机,开发者计划为不同层面的开发者提供不同等级的资格,资格的划分还考虑到以下因素:补充业务与北电网络平台的集合程度,开发者团体与北电网络的合作关系,等等. 2.编程 将整数转换成字符串:void itoa(int,char);

例如itoa(-123,s[])则s="-123";

网易

1、10个人分成4组 有几种分法?

2、如图:

7 8

9 10

6 1

2 11

5 4

3 12

16 15

14 13 设"1"的坐标为(0,0) "7"的坐标为(-1,-1) 编写一个小程序,使程序做到输入坐标(X,Y)之后显示出相应的数字.

3、#includenext = pTemp->next;

pTemp->next = newNode;

m_listLength++;

return true;

} //remove the node after a specified node bool LinkList::RemoveAfter(int removenode) { LNode *pTemp = m_pList;

int curPos=-1;

if (removenode > m_listLength) // 删除点超过总长度 { return false;

} // 找到指定的节点后一个节点,因为删除的是后一个节点 while (pTemp?!= NULL) { curPos++;

if (curPos == removenode+1) break;

pTemp = pTemp->next;

} if (curPos?!= removenode) // 节点未寻到,错误退出 { return false;

} LNode *pDel = NULL;

// 删除节点 pDel = pTemp->next;

pTemp->next = pDel->next;

delete pDel;

m_listLength--;

return true;

} //sort the linked list to descending order. void LinkList::sort() { if (m_listLength