试题与答案

HPLC法中色谱柱的理论塔板数用于评价()。 A.分析时间 B.保留时间 C.柱效

题型:单项选择题 A1/A2型题

题目:

HPLC法中色谱柱的理论塔板数用于评价()。

A.分析时间

B.保留时间

C.柱效

D.柱压

E.流速

答案:

参考答案:C

试题推荐
题型:完形填空
Birthdays often bring surprises. But this year’s surprise on the birthday of the great British playwright William Shakespeare is __21__ one of the most surprising.
On April 22, one day before his 441st birthday anniversary, experts __22__ that one of the most recognizable __23__ of William Shakespeare is a fake (赝品).
This __24__ that we no longer have a good __25__ of what Shakespeare looked like. “It’s very possible that many pictures of Shakespeare are unreliable because many of them are __26__ of this one,” said an expert from Britain’s National Portrait Gallery.
The _27_ comes after four months of testing. Experts from the gallery say the image — commonly known as the “Flower portrait” — was actually __28__ in the 1800s, two centuries __29_  Shakespeare’s death.
The art experts who work at the gallery say they used modern chemistry technology to __30__ the paint on the picture. These checks found traces (痕迹) of paint deep in the picture __31__ about 1814.
Shakespeare __32__ in 1616, and the date that appears on the portrait is 1609.
“We now think the portrait dates back to around 1818 to 1840. This was __33__ there was a new interest in Shakespeare’s__ 34__ ,” Tanya Cooper, the gallery’s 16th century curator (馆长) said.
The __35__ picture has often been used as a cover for __36__ of his plays. It is called the “Flower portrait” because one of its __37__, Desmond Flower, gave it to the Royal Shakespeare Company.
“There have always been __38__ about the authenticity (真实性) of the painting,” said David Howells, curator for the Royal Shakespeare Company.
“Now we know the truth, we can put the image in its proper place in the history of Shakespearean portraiture (画像技法),” he said.
Two other images of Shakespeare are also being studied as part of the investigation and the results will __39__later in May. But for now what Shakespeare really looked like will remain a __40__.
小题1:
A.surelyB.neverC.hardlyD.only
小题2:
A.wonderedB.doubtedC.foundD.considered
小题3:
A.playsB.masterpiecesC.portraitsD.photos
小题4:
A.recommendsB.advisesC.decidesD.means
小题5:
A.newsB.ideaC.design D.expression
小题6:
A.bargainsB.productionsC.copiesD.prints
小题7:
A.justiceB.discoveryC.inventionD.deed
小题8:
A.clonedB.developedC.paintedD.copied
小题9:
A.afterB.beforeC.sinceD.until
小题10:
A.tryB.removeC.washD.check
小题11:
A.looking backB.dating fromC.getting alongD.starting with
小题12:
A.diedB.was bornC.succeededD.was buried
小题13:
A.whyB.whenC.howD.what
小题14:
A.storiesB.picturesC.playsD.photos
小题15:
A.realB.originalC.valuableD.fake
小题16:
A.requirementsB.collectionsC.consequencesD.playwrights
小题17:
A.ownersB.paintersC.writersD.readers
小题18:
A.causesB.problemsC.questionsD.orders
小题19:
A.go aboutB.come outC.turn upD.break out
小题20:
A.surpriseB.problemC.secretD.mystery
查看答案
题型:问答题

[说明]
假定用一个整型数组表示一个长整数,数组的每个元素存储长整数的一位数字,则实际的长整数m表示为:
m=a[k]×10k-2+a[k-1]×10k-3+…+a[3]×10+a[2]
其中a[1]保存该长整数的位数,a[0]保存该长整数的符号:0表示正数、1表示负数。
运算时先决定符号,再进行绝对值运算。对于绝对值相减情况,总是绝对值较大的减去绝对值较小的,以避免出现不够减情况。注意,不考虑溢出情况,即数组足够大。
[函数]
int cmp(int *LA, int *LB);
/*比较长整数LA与LB的绝对值大小*/
/*若LA绝对值较大返回正值,LA较小返回负值,相等则返回0*/
int ADD (int *LA, int *LB, int *LC)
/*计算长整数LA与LB的和,结果存储于LC中*/
/*注意:正数与负数的和相当于正数与负数绝对值的差*/
/*数据有误返回0,正常返回1*/

if(LA == NULL || LB == NULL || LC == NULL)return 0;
int *pA, *pB, i, N, carry, flag;
flag = LA[0] + LB[0];
switch(flag) /*根据参与运算的两个数的符号进行不同的操作*/
case 0:
case 2:
Lc[0] = LA[0];/*LA与LB同号,结果符号与LA(LB)相同*/
pA = LA;
pB = LB;
(1) ;
break;
case 1: /*LA与LB异号*/
/*比较两者的绝对值大小,结果符号与较大者相同*/
flag = (2) ;
if(flag > 0) /*LA较大*/
LC[0] = LA[0];
pA = LA;
pB = LB;

else if(flag < 0)(/*LB较大*/
LC[0] = LB[0];
pA = LB;
pB = LA;

else/*LA与LB相等*/
LC[0] = 0;
LC[1] = 0;
return 1;

flag = -1;
break;
default:
return 0;
break;
/*switch*/
/*绝对值相加减*/
/*注意对于减法pA指向较大数,pB指向较小数,不可能出现不够减情况*/
(3) ;
N = LA[1] > LB[1] LA[1] : LB[1];
for(i = 0; i < N; i++)
if(i >= pA[1])/*LA计算完毕*/
carry += flag * pB[i+2];

else if(i >= pB[1])/*LB计算完毕*/
carry += pA[i+2];

else
carry += pA[i+2] + flag * pB[i+2];

LC[i+2] = carry % 10;
carry /= 10;
if( (4) )/*需要借位,针对减法*/
LC[i+2] += 10;
carry--;

/*for*/
if( (5) )/*最高进位,针对加法*/
LC[i+2] = carry;
i++;

if(LC[i+1] == 0) i--; /*若最高位为零,针对减法*/
LC[1] = i;
return 1;
;/*ADD*/

查看答案
微信公众账号搜索答案