中兴笔试面试题.doc

文档介绍：中兴笔试面试题
中兴
1某人在某个市场某个商家买了某台电脑,请用你熟悉的计算机语言表达出里面的关系其中有商家类,买家类,商品类。还要有买方法,卖方法。
2一个完整的单例模式
3曹操南下攻打刘备,刘备派关羽守锦州,关羽派张飞去守城门。刘备又派诸葛亮去向孙权求援。孙权派兵攻打曹操!
请画出UML图
2006年12月中兴在我们学校的笔试,最后的大题
其实这些大公司的笔试不难,也不就是如此,只要学一下数据结构就可以搞定!?
排序及查找方法#include
#include
#define N 11
/*用监视哨查找*/
int searchint array[],int n,int k
int i;
?in-1;
array[0]k;
whilearray[i]!k i--;
returni;
/*折半查找法*/
int halfsearchint array[],int n,int k
int i,j,mid;
?i1;jn;
whileij
midi+j/2;
?ifkarray[mid] returnmid;
else ifkarray[mid] jmid-1; else imid+1;
return0;
/*冒泡排序法*/
void mpsortint array[]
int i,j,a;
a0;
?fori1;iN;i++forji+1;jN;j++ ifarray[i]array[j]aarray[i];array[i]array[j];array[j]a;
/*直接插入排序*/
void insertsortint array[]
int i,j;
?fori2;iN;i++
?array[0]array[i];
ji-1;
whilearray[0]array[j]
?array[j+1]array[j--];
?array[j+1]array[0];
/*建立*/
void creatint array[]
int i;
?printf"enter the array:\n";
?fori1;iN;i++
?scanf"%d",&array[i];
/*显示*/
void printint array[]int i; printf"The numbers after sort is:\n"; fori1;iN;i++ printf"%d ",array[i]; printf"\n";
main
int a[11],i,x,chang;
?/*printf"enter the array\n";
?fori1;i11;i++
?scanf"%d",&a[i];*/
aga:
?printf"\nchang:1: use watching method finding\n2:use half method finding\n3: use directness intsert method sort\n4:use bubble up method sort\n5:exit\n";
?scanf"%d",&chang;
?switch chang
?case 1:? creata;
?printf"Please int the search number:\n";
?scanf"%d",&x;
?printf"The number station is:%d\n",searcha,N,x;
?goto aga;
?case 2: creata;? insertsorta;? printa;? printf"Please int the search number:\n";? scanf"%d",&x;? printf"The number station is:%d\n",halfsearcha,N,x;? goto aga; case 3:creata; insertsorta; printa; goto aga; case 4:creata; mpsorta; printa; goto aga; case 5: printf"exit!\n";break; default:printf"Error!\n"; goto aga;
?
二、线性链表的存储实现
struct LNODE
ElemType data;
struct LNODE *next;
;
typedef struct LNODE LNode;
typedef struct LNODE * LinkList;
1初始化操作
Status Init_LLinkList L
if LLinkList *mall