mtk深圳公司嵌入式软件工程师笔试题+文档.docVIP

HYPERLINK /xinxin/articles/44076.html MTK深圳公司嵌入式软件工程师笔试题 //MTK深圳嵌入式软件工程师笔试题(B卷)//1*****************************************#define pi 3.14#define Area(R) pi*R*Rmain(){?int r1=5,r2=2;?double s=0;?s=Area(r1-r2);?printf(The area is %f,s);}//求结果 //2*********************************************//函数 int compare(int a,int b),定义为该函数的函数指针P:为_______________//3*********************************************#includestdio.hvoid sub(char*s,int num){?int i ,j=num;?char t;?while(j--1)?{???for(i=0;ij;i++)???{?????if(s[i]s[i+1])?????{???????t=s[i];???????s[i]=s[i+1];???????s[i+1]=t;?????}???}?}}main(){?char*s=CEAeded;?sub(s,6);?printf(%s\n,s)}//求结果//4**********************************************//交换两个变量的值,不使用第三个变量,即a=3,b=5交换//后b=3,a=5???? unsigned char a=3,b=5;???? ???? //5**************************************************#define N 100void GetMemory1(char*p){?p=(char*)malloc(sizeof(char)*N);?strcpy(p,Have a good day!);}char*GetMemory2(void){?char p[]=Have a good day!;?return p;}void main(void){?char*str1=NULL,*str2=NULL;?GetMemory1(str1);?GetMemory2(str2);?printf(\nstr1:%s,str1);?printf(\nstr2:%s,str2);?//6******************************************************//构造N个结点的单链表返回链表头指针,要求链表中各结点顺序//与结点数据输入顺序相反,例如输入1,2,3,4,5,形成的链表为//head-5 4 3 2 1 ,补充程序#define N 10typedef struct Node{?int data;?struct Node*next;}NODE;int Get_Data(int i);//定义省略Node*Create_u(){?int i;?NODE*p,*Head=NULL;?for(i=0;iN;i++)?{??VP=New NODE;??P-Data=Get_Data(i);??________________;??________________;?}?return Head;}//7**********************************************//N个结点链表,每个结点中存放一个字符,判断链表存放的字符是否//中心对称,即a b c c b a或a b c b a,补充程序typedef struct Node{?int data;?struct Node*next;}NODE;bool Is_symmeic(NODE*head,*int n){?char D[N];?int i,d;?__________;?for(i=0;id;i++)?{??D[i]=head-data;??head=head-next;?}?if(__________)?{??head=head-next;?}?while(head)?{??_______________;??if(D[i]!=head-data)??{???return false