广东北电英文笔试题(请大家回复作答)1.Tranlation(Mandatory)CDMA.doc

广东北电英文笔试题(请大家回复作答)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).作答(仅供参考) 1 翻译题(必答)CDMA 厂商们已经竭力开发出一种用于CDMA手机上使用的名为RUIM的SIM卡,进而能够使CDMA漫 游,这种为中国联通开发的新CDMA上使用的SIM卡在中国进一步开发与推广,韩国KTF公司在今年年初 向公众展示其采用此卡在GSM与CDMA间进行漫游,尽管如此, 也只有那些含有用户服务数据的卡才能实 现漫游功能, 相反那些一般的CDMA手机或只含有用户手机号的是不行的(除非通过转移) 2. Programming (Mandatory) Linked lista. 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.编程题(必答)链表a 实现一个整数链表, 并支持插入运算(在给定的结果后插入)和删除运算(移除给定的结点),b 实现一个方法来对链表进行除序排序; // 单链表结构体为 typedef struct LNode { int data; struct LNode *next; }LNode, *pLinkList; // 单链表类 class LinkList { private: pLinkList m_pList; int m_listLength; public: LinkList(); ~LinkList(); bool InsertAfter(int afternode, int data);//插入 bool RemoveAfter(int removenode);//删除 void sort();//排序 }; 实现方法 //insert a node after a specified node bool LinkList::InsertAfter(int afternode, int data) { LNode *pTemp = m_pList; int curPos = -1; if (afternode m_listLength ) // 插入点超过总长度 { return false; } while (pTemp != NULL) // 找到指定的节点 { curPos++; if (curPos == afternode) break; pTemp = pTemp-next; } if (curPos != afternode) // 节点未寻到，错误退出 { return false; } LNode *newNode = new LNode; // 将新节点插入指定节点后 newNode-data = data; newNode-next = pTemp-next; pTemp-next = newNode; m_listLength++; return true; } //remove the node after a specified node bool Li