运行以下程序后,输出的图形是()。 For r=0 To 150 Circle(320,240),r For i=1 To l000 Next i Next rA.一个半径逐渐变小的空心圆B.一个固定的空心圆C.一个半径逐渐变大的空心圆D.一个固定的实心圆

运行以下程序后,输出的图形是()。 For r=0 To 150 Circle(320,240),r For i=1 To l000 Next i Next r

A.一个半径逐渐变小的空心圆

B.一个固定的空心圆

C.一个半径逐渐变大的空心圆

D.一个固定的实心圆


参考答案和解析
D

相关考题:

假定有以下程序段 n=0 for i=1 to 3 for j=-4 to -1 n=n+1 next j next i 运行完毕后,n的值是________。A.0B.3C.4D.12

以下程序的输出结果是 ( ) main( ) { union { char i [2]; int k; } r; r. i[0]=2,r.i[1]=0; printf("%d\n",r,k); }A.2B.1C.0D.不确定

以下程序的输出结果是 ______。 Dim n(2,2), i, j As Integer For i = 0 To 2 For j = 0 To 2 n(i,j) = i + j Next j Next i For i = 0 To 1 For j = 0 To 1 n(i+ 1 ,j + 1) = n(i + 1,j + 1) + n(i, j) Next j Next i Print n(i, j)A.14B.0C.6D.值不确定

下面程序的输出结果是()。include f(int b[],int n){ int i,r;r = 1;for(i=0;i 下面程序的输出结果是( )。 include <stcdio.h> f(int b[],int n) { int i,r; r = 1; for(i=0;i<=n;i++) r=r*b[i]; return r; } main() { int x,a[]={2,3,4,5,6,7,8,9}; x=f(a,3); printf("%d\n",x); }A.720B.120C.24D.6

假定有以下程序段 n=0 For i=1 To 3 For j=-4 To-1 n=n+1 Next j Next i 运行完毕后,n的值是( )。A.0B.3C.4D.12

有以下程序#includestruct NODE{ int num; struct NODE *next; };main(){ struct NODE *p,*q,*r;p=(struct NODE*)malloc(sizeof(struct NODE));q=(struct NODE*)malloc(sizeof(struct NODE));r=(struct NODE*)malloc(sizeof(struct NODE));p-num=10; q-num=20; r-num=30;p-next=q;q-next=r;printf("%d\n ",p-num+q-next-num);}程序运行后的输出结果是A.10B.20C.30D.40

以下程序的输出结果为 Dim i,c(10),p(3) k=5 For i=0 To 10 c(i) =i Next i For i=0 To 2 p(i) = c(i * (i + 1)) Next i For i=0 To 2 k=k+p(i) * 2 Next i Print kA.20B.21C.56D.32

运行以下程序段后,输出结果为【 】。For I=1 To 3CisPrint"I=",I;Next

有以下结构体说明和变量定义,如图所示,指针p、q、r分别指向一个链表中的三个连续结点。struct node{ int data;struct node *next;} *p, *q, *r;现要将q和r所指结点的先后位置交换,同时要保持链表的连续,以下错误的程序段是A.r->next=q; q->next=r->next; p->next=r;B.q->next=r->next; p->next=r; r->next=q;C.p->next=r; q->next=r->next; r->next=q;D.q->next=r->next; r->next=q; p->next=r;

有以下程序: inClude structNODE{ int num; structNODE*next; }; main() {StructN00E 有以下程序:#inClude <stdlib.h>struct NODE{int num;struct NODE *next;};main(){ Struct N00E *p,*q,*r;int sum;0;p=(struct NODE *)malloc(sizeof(struct NODE));q=(struct NODE *)malloc(sizeof(struct NODE));r=(struct NODE *)malloc(Sizeof(struct NODE));p->num=1;q->num=2;r->num=3;p->next=q;q->next=r;r->next=NULL;sum+=q->next->num;sum+=p->num;printf("%d\n",sum);}执行后的输出结果是A.3B.4C.5D.6

当执行以下过程时,在名为lblResult的标签框内将显示______。Private Sub Command1_ Click() Dim I, R R = 0 for I = 1 To 5 step 1 R= R+ I Next I lblResult. Caption = Str$(R)End SubA.字符串15B.整数15C.字符串5D.整数5

以下程序的输出结果是_______。 main() {union { char i[2]; int k; }r; r.i[0]=2; r.i[1]=0; printf("%d\n",r.k); }A.2B.1C.0D.不确定

在窗体中添加一个标签LblResult和一个命令按钮Command1,然后编写程序。程序的功能是单击命令按钮,计算1+2+3+4+5的值,并把结果转化为字符串显示在标签内,能够实现上述功能的程序段是, ( )A.Private Sub Command1_Click() Dim I,R As Integer For I=1 To 5 Step 1 R=R+I Next LblResult. Name=Str$ (R) End SubB.Private Sub Command1_ClickO Dim I,R As Integer For I=1 To 5 Step 1 R=R+I Next LblResult. Caption= Str$ (R) End SubC.Private Sub Command1_Click() Dim I,R As Integer Do While I<5 R=R+I I=I+1 Loop LblResult. Caption=Str$ (R) End SubD.Private Sub Command1_Click() Dim I,R As Integer Do R=R+I I=I+1 Loop While I<5 LblResult. Caption=Str$ (R) End Sub

以下程序运行后的输出结果是【 】。struct NODE{int num;struct NODE *next;};main(){struct NODE s[3]={{1,'\0'},{2,'\0'},{3,'0'}},*p,*q,*r;int sum=0;s[0].next=s+1;s[1].next=s+2;s[2].next=s;p=s; q=p->next; r=q->next;sum+=q->next->num; sum+=r->next->next->num;printf("%d\n",sum);}

有以下程序 include struct NODE {int num;stmct NODE*next;}; main() { struct NODE 有以下程序#include<stdlib.h>struct NODE{ int num;stmct NODE*next;};main(){ struct NODE*p,*q,*r;p=(struct NODE*)malloc(sizeof(struct NODE));q=(struct NODE*)malloc(sizeof(struct NODE));r=(struct NODE*)malloc(sizeof(struct NODE));p->num=10;q->num=20;r->num=30;p->next=q;q->next=r;printf(“%d\n”,p->num+q->next->num);}程序运行后的输出结果是A.10B.20C.30D.40

有以下程序 include struct NODE{ int num; struct NODE *next;}; main( ) 有以下程序#include <stdlib.h>struct NODE{int num;struct NODE *next;};main( ){ struct NODE *p,*q,*r;int sum=0;p=(struct NODE *)malloc(sizeof(struct NODE));q=(struct NODE *)malloc(sizeof(struct NODE));r=(struct NODE *)malloc(sizeof(struct NODE));p->num=1;q->num=2;r->num=3;p->next=q;q->next=r;r->next=NULL;sum+=q->next->num;sum+=p->num;printf(“%d\n”,sum);}执行后的输出结果是A.3B.4C.5D.6

运行程序段后输出______个“*”号。 For i=1 To 2 For j=0 To i-1 Print"*" Next j Next iA.1B.2C.3D.4

当执行以下过程时,在名为1blResult的标签框内将显示______。 Private Sub cmdlt_ click() Dim I,R R=0 For I=1 To 5 Step 1 R=R+I Next i 1blResult.Caption=Str$(R) End SubA. 字符串15B.整数15C.字符串5D.整数5

运行以下程序后,输出的图形是( )。 Forr=O To 150 Circle(320,240),r Fori=1 To 1000 Nexti NextrA.一个固定的空心圆B.一个半径逐渐变大的空心圆C.一个固定的实心圆D.一个半径逐渐变大的实心圆

下面程序运行后输出结果是( )。 For I=1 to 2 S=1 For j=0 to I-1 S=S+S*I Next j Print S Next IA.1 1B.0 2C.2 9D.6 9

假定有以下程序段 n=0 for i=1 to 3 for j=-3 to 1 n=n+1 next j next i 运行完毕后,n的值是( )。A.3B.4C.12D.15

有以下结构体说明和变量定义,如下图所示,指针p、q、r分别指向一个链表中的3个连续结点。 struct node { int data; struct node *next; } *p,*q,*r;现要将q和r所指结点的先后位置交换,同时要保持链表的连续,以下错误的程序段是( )。A.r->next=q;q->next=r->next;p->next=r;B.q->next=r->neaxt;p->next=r;r->next=q;C.p->next=r;q->next=r->next;r->next=q;D.q->next=r->next;r->next=q;p->next=r;

有以下结构体说明和变量定义,如图所示,指针p、 q、 r分别指向一个链表中的三个连续结点。 struct node int data; struct node *next; } *p, *q,*r;现要将q和r所指结点的先后位置交换,同时要保持链表的连续,以下错误的程序是A.r->next=q; q->next=r->next; p->next=r;B.q->next=r->next; p->next=r; r->next=q;C.p->next=r; q->next=r->next; r->next=q;D.q->next=r->next; r->next=q; p->next=r;

读程序:includef(int b[],int n){ int i,r;r=1;for(i=0;i 读程序: #include <stdio.h> f(int b[],int n) { int i,r; r=1; for(i=0;i<=n;i++) r=r*b[i]; return r; } main() { int x,a[]={2,3,4,5,6,7,8,9}; x=f(a,3); printf("%d\n",x); } 上面程序的输出结果是( )。A.720B.120C.24D.6

以下程序运行后,消息框的输出结果是( )。 OPTION BASE 1 PRIVATE SUB COMMAND1_CLICK( ) DIM A(10) , P(3) AS INTEGER K=5 FOR I=1 TO 10 A(I) = I NEXT I FOR I=1 TO 3 P(I)=A(I*I) NEXT I FOR I=1 TO 3 K=K+P (I) ~ 2 NEXT I MSGBOX K END SUBA.33B.28C.35D.37

有以下程序 inGlude struct NODE { int num; struct NODE *next; } main() {struct N 有以下程序#inGlude<stdlib.h>struct NODE {int num;struct NODE *next;}main(){ struct NODE *p,*q,*r;int sum=0;p=(struct NODE*)malloc(sizeof(struct NODE));q=(struct NODE*)malloc(sizeof(struct NODE));r=(stnlct NODE*)malloc(sizeof(struct NODE));p->num=1;q->num=2;r->num=3;p->next=q;q->next;r;r->next=NULL;sum+=q->next->Num,sum+=p->num;printf("%d\n",sum);}执行后输出结果是A.3B.4C.5D.6

指针p、q和r依次指向某循环链表中三个相邻的结点,交换结点*q和结点*r在表中次序的程序段是 ( )A.p—>next=r; q—>next=r—>next; r—>next=q;B.p—>next=r; r—>next=q; q—>next=r—>next;C.r—>next=q; q—>next=r—>next; p—>next=r;D.r—>next=q; p—>next=r; q—>next=r—>next;

单选题A company uses Routers R1 and R2 to connect to ISP1 and ISP2, respectively, with Routers I1 and I2 used at the ISPs. R1 peers with I1 and R2; R2 peers with I2 and R1. Assuming as many default s ettings as possible are used on all four routers, which of the following is true about the next - hop IP address for routes R1 learns over its iBGP connection to R2?()AThe next hop is I2's BGP RIDBThe next hop is I2's IP address used on the R2 - I2 neigh bor relationshipCThe next hop is R2's BGP RIDDThe next hop is R2's IP address used on the R1 - R2 neighbor relationship