• 2022-06-06 问题

    对一个存储空间为n的顺序队列,若头指针为h,尾指针为r,将其在逻辑上看成一个环,则队列中元素个数为( )。 A: r-h B: n C: (r-h+1)mod n D: (n+r-mod n

    对一个存储空间为n的顺序队列,若头指针为h,尾指针为r,将其在逻辑上看成一个环,则队列中元素个数为( )。 A: r-h B: n C: (r-h+1)mod n D: (n+r-mod n

  • 2021-04-14 问题

    求给定自然数m和n的最大公约数。请完善程序。 Private Sub Command1_Click() Dim m As Integer, n As Integer, r As Integer m = Text1.Text n = Text2.Text If m < n Then r = m: m = n: n = r Do r = m Mod n m = n n = r Loop Until__________ Text3.Text = m End Sub Private Sub Command2_Click() Dim m As Integer, n As Integer, r As Integer m = Text1.Text n = Text2.Text If m < n Then r = m: m = n: n = r r = m Mod n Do Until _______ m = n n = r r = m Mod n Loop Text3.Text =____ End Sub Private Sub Command3_Click() Dim m As Integer, n As Integer, r As Integer m = Text1.Text n = Text2.Text If m < n Then r = m: m = n: n = r Do r = m Mod n m = n n = r Loop While________ Text3.Text =______ End Sub Private Sub Command4_Click() Dim m As Integer, n As Integer, r As Integer m = Text1.Text n = Text2.Text If m < n Then r = m: m = n: n = r r = m Mod n Do While______ m = n n = r r = m Mod n Loop Text3.Text =____ End Sube73f1fd63959cc8362d8c82d419c2353.png

    求给定自然数m和n的最大公约数。请完善程序。 Private Sub Command1_Click() Dim m As Integer, n As Integer, r As Integer m = Text1.Text n = Text2.Text If m < n Then r = m: m = n: n = r Do r = m Mod n m = n n = r Loop Until__________ Text3.Text = m End Sub Private Sub Command2_Click() Dim m As Integer, n As Integer, r As Integer m = Text1.Text n = Text2.Text If m < n Then r = m: m = n: n = r r = m Mod n Do Until _______ m = n n = r r = m Mod n Loop Text3.Text =____ End Sub Private Sub Command3_Click() Dim m As Integer, n As Integer, r As Integer m = Text1.Text n = Text2.Text If m < n Then r = m: m = n: n = r Do r = m Mod n m = n n = r Loop While________ Text3.Text =______ End Sub Private Sub Command4_Click() Dim m As Integer, n As Integer, r As Integer m = Text1.Text n = Text2.Text If m < n Then r = m: m = n: n = r r = m Mod n Do While______ m = n n = r r = m Mod n Loop Text3.Text =____ End Sube73f1fd63959cc8362d8c82d419c2353.png

  • 2022-06-26 问题

    下列计算最大公约数的递归过程,正确的是___________。 A: Sub gcd(ByVal m%, ByVal n%) Dim r% r = m n If r = 0 Then gcd = n Else gcd = gcd(n, r) End If End Sub B: Sub gcd(ByVal m%, ByVal n%) Dim r% r = m Mod n If r = 0 Then gcd = n Else gcd = gcd(n, r) End If End Sub C: Function gcd%(ByVal m%, ByVal n%) Dim r% r = m n If r = 0 Then gcd = n Else gcd = gcd(n, r) End If End Function D: Function gcd%(ByVal m%, ByVal n%) Dim r% r = m Mod n If r = 0 Then gcd = n Else gcd = gcd(n, r) End If End Function

    下列计算最大公约数的递归过程,正确的是___________。 A: Sub gcd(ByVal m%, ByVal n%) Dim r% r = m n If r = 0 Then gcd = n Else gcd = gcd(n, r) End If End Sub B: Sub gcd(ByVal m%, ByVal n%) Dim r% r = m Mod n If r = 0 Then gcd = n Else gcd = gcd(n, r) End If End Sub C: Function gcd%(ByVal m%, ByVal n%) Dim r% r = m n If r = 0 Then gcd = n Else gcd = gcd(n, r) End If End Function D: Function gcd%(ByVal m%, ByVal n%) Dim r% r = m Mod n If r = 0 Then gcd = n Else gcd = gcd(n, r) End If End Function

  • 2022-06-09 问题

    下面哪个表达式在n是偶数时,计算结果是True? A: mod n 2 B: mod n 2 = 0 C: n `mod` 2 == 0 D: mod 2 n == 0

    下面哪个表达式在n是偶数时,计算结果是True? A: mod n 2 B: mod n 2 = 0 C: n `mod` 2 == 0 D: mod 2 n == 0

  • 2022-06-06 问题

    对一个存储空间为n的顺序队列,若头指针为h,尾指针为r,将其在逻辑上看成一个环,则队列中元素个数为( )。 A: r-h B: n C: (r-h+1)mod n D: (n+r-h)mod n

    对一个存储空间为n的顺序队列,若头指针为h,尾指针为r,将其在逻辑上看成一个环,则队列中元素个数为( )。 A: r-h B: n C: (r-h+1)mod n D: (n+r-h)mod n

  • 2022-06-09 问题

    R[i]=(n)MOD(m)表示将两个值的商的整数代入寄存器i。[/i]

    R[i]=(n)MOD(m)表示将两个值的商的整数代入寄存器i。[/i]

  • 2022-06-19 问题

    下列函数中为双射的是(). A: Z→Z,f(j)=j(mod)3; B: f:N→N,f(j)=3j; C: f:Z→N,f(j)=|2j|+1 D: f:R→R,f(r)=2r-15

    下列函数中为双射的是(). A: Z→Z,f(j)=j(mod)3; B: f:N→N,f(j)=3j; C: f:Z→N,f(j)=|2j|+1 D: f:R→R,f(r)=2r-15

  • 2022-05-30 问题

    对于顺序存储的队列,存储空间大小为n,头指针为F,尾指针为R。若在逻辑上看一个环,则队列中元素的个数为()。 A: R-F B: n+R-F C: (R-F+1)Mod n D: (n+R-F)Mod n

    对于顺序存储的队列,存储空间大小为n,头指针为F,尾指针为R。若在逻辑上看一个环,则队列中元素的个数为()。 A: R-F B: n+R-F C: (R-F+1)Mod n D: (n+R-F)Mod n

  • 2022-07-24 问题

    设n为整型变量,且n:=1997,下面能将n的十位数字(即右边第2位数字)分离出来的语句是() A: d:=n mod 100 B: d:=n div 100; C: d:=n div 100 mod 10; D: d:=n mod 100 div 10

    设n为整型变量,且n:=1997,下面能将n的十位数字(即右边第2位数字)分离出来的语句是() A: d:=n mod 100 B: d:=n div 100; C: d:=n div 100 mod 10; D: d:=n mod 100 div 10

  • 2022-06-26 问题

    将十进制正整数d转换成r(2~9)进制的字符串,下列递归函数正确的是__________。 A: Function Trans$(ByVal d%, ByVal r%) If d = 0 Then Trans = "" Else Trans = Trans(d \ r, r) &amp; (d Mod r) End If End Function B: Function Trans$(ByVal d%, ByVal r%) If d = 0 Then Trans = "" Else Trans = (d Mod r) &amp; Trans(d \ r, r) End If End Function C: Function Trans$(ByVal d%, ByVal r%) If d = 0 Then Trans = Trans(d \ r, r) &amp; (d Mod r) Else Trans = "" End If End Function D: Function Trans$(ByVal d%, ByVal r%) If d = 0 Then Trans = (d Mod r) &amp; Trans(d \ r, r) Else Trans = "" End If End Function

    将十进制正整数d转换成r(2~9)进制的字符串,下列递归函数正确的是__________。 A: Function Trans$(ByVal d%, ByVal r%) If d = 0 Then Trans = "" Else Trans = Trans(d \ r, r) &amp; (d Mod r) End If End Function B: Function Trans$(ByVal d%, ByVal r%) If d = 0 Then Trans = "" Else Trans = (d Mod r) &amp; Trans(d \ r, r) End If End Function C: Function Trans$(ByVal d%, ByVal r%) If d = 0 Then Trans = Trans(d \ r, r) &amp; (d Mod r) Else Trans = "" End If End Function D: Function Trans$(ByVal d%, ByVal r%) If d = 0 Then Trans = (d Mod r) &amp; Trans(d \ r, r) Else Trans = "" End If End Function

  • 1 2 3 4 5 6 7 8 9 10