• 2022-06-16 问题

    对信码1000100100001000011000011进行HDB3编码,结果可能是( )。 A: -1 0 0 0 +1 0 0 -1 0 0 0 -V +1 0 0 0 +V -1 +1 -B 0 0 -V +1 -1 B: +1 0 0 0 -1 0 0 +1 0 0 0 +V -1 0 0 0 -V +1 -1 +B 0 0 +V -1 +1 C: +1 0 0 0 -1 0 0 +1 0 0 0 +1 -1 0 0 0 -1 +1 -1 +1 0 0 +1 -1 +1 D: -1 0 0 0 +1 0 0 -1 0 0 0 +V +1 0 0 0 +V -1 +1 +B 0 0 -V +1 -1

    对信码1000100100001000011000011进行HDB3编码,结果可能是( )。 A: -1 0 0 0 +1 0 0 -1 0 0 0 -V +1 0 0 0 +V -1 +1 -B 0 0 -V +1 -1 B: +1 0 0 0 -1 0 0 +1 0 0 0 +V -1 0 0 0 -V +1 -1 +B 0 0 +V -1 +1 C: +1 0 0 0 -1 0 0 +1 0 0 0 +1 -1 0 0 0 -1 +1 -1 +1 0 0 +1 -1 +1 D: -1 0 0 0 +1 0 0 -1 0 0 0 +V +1 0 0 0 +V -1 +1 +B 0 0 -V +1 -1

  • 2022-06-15 问题

    某反应A(g)+B(g)=C(g)的速率方程为v=K{c(A)} A: 1/6 B: 8倍 C: 1/4 D: 1/8

    某反应A(g)+B(g)=C(g)的速率方程为v=K{c(A)} A: 1/6 B: 8倍 C: 1/4 D: 1/8

  • 2022-07-23 问题

    MATLAB中调用v=eye(2,1)后的结果为 A: v=[1;0] B: v=[1,0] C: v=[0;1] D: v=[1 0;0 1]

    MATLAB中调用v=eye(2,1)后的结果为 A: v=[1;0] B: v=[1,0] C: v=[0;1] D: v=[1 0;0 1]

  • 2022-06-26 问题

    设V为n维线性空间,σ,τ∈L(V),且στ=τσ,则σV,σ-1(0)均为τ-子空间.故τV,τ-1(0)均为σ-子空间.若σV,σ-1(0)均为τ-子空间,τV,τ-1(0)均为σ-子空间,则στ=τσ?

    设V为n维线性空间,σ,τ∈L(V),且στ=τσ,则σV,σ-1(0)均为τ-子空间.故τV,τ-1(0)均为σ-子空间.若σV,σ-1(0)均为τ-子空间,τV,τ-1(0)均为σ-子空间,则στ=τσ?

  • 2022-07-25 问题

    某max型线性规划标准型的目标系数为(1 5 2 6 0 3). 模型的单纯形矩阵经过一系列迭代,化为如下最优典式: 0 3 0 1 1 3 | 6 1 0 0 0 6 -1 | 3 0 -1 1 0 1 -1 | 1 0 -2 0 0 -4 -1 | -10则可知最优解中基变量对应的目标系数向量CB为 ( ) A: (6 1 2) B: (4 1 3) C: (1 2 6) D: (0 4 1)

    某max型线性规划标准型的目标系数为(1 5 2 6 0 3). 模型的单纯形矩阵经过一系列迭代,化为如下最优典式: 0 3 0 1 1 3 | 6 1 0 0 0 6 -1 | 3 0 -1 1 0 1 -1 | 1 0 -2 0 0 -4 -1 | -10则可知最优解中基变量对应的目标系数向量CB为 ( ) A: (6 1 2) B: (4 1 3) C: (1 2 6) D: (0 4 1)

  • 2022-05-31 问题

    $u$, $v\in E^3$, $u=(0,-1,1),v=(1,-1,-1)$. What is $||u \times v||^2$:<br/>______

    $u$, $v\in E^3$, $u=(0,-1,1),v=(1,-1,-1)$. What is $||u \times v||^2$:<br/>______

  • 2022-05-31 问题

    $u$, $v\in E^3$, $u=(0,-1,1),v=(1,-1,-1)$. What is $\langle{u,v}\rangle$:<br/>______

    $u$, $v\in E^3$, $u=(0,-1,1),v=(1,-1,-1)$. What is $\langle{u,v}\rangle$:<br/>______

  • 2022-05-31 问题

    已知某LP模型的约束方程组的增广矩阵化简为:0 -1 0 8 1 | 61 0 0 2 0 | 10 2 1 0 0 | 3则从中可以读出的基可行解为( ) A: (1 0 3 0 6) B: (6 1 3 0 0) C: (0 0 6 1 3) D: (0 0 3 1 6)

    已知某LP模型的约束方程组的增广矩阵化简为:0 -1 0 8 1 | 61 0 0 2 0 | 10 2 1 0 0 | 3则从中可以读出的基可行解为( ) A: (1 0 3 0 6) B: (6 1 3 0 0) C: (0 0 6 1 3) D: (0 0 3 1 6)

  • 2021-04-14 问题

    【单选题】rev(c(1,3,2,6,7,8,8,1,1,0))的运行结果 ? A. [1] 0 1 1 1 2 3 6 7 8 8 B. [1] 1 3 2 6 7 8 8 1 1 0 C. [1] 0 1 1 8 8 7 6 2 3 1 D. [1] 8 8 7 6 3 2 1 1 1 0

    【单选题】rev(c(1,3,2,6,7,8,8,1,1,0))的运行结果 ? A. [1] 0 1 1 1 2 3 6 7 8 8 B. [1] 1 3 2 6 7 8 8 1 1 0 C. [1] 0 1 1 8 8 7 6 2 3 1 D. [1] 8 8 7 6 3 2 1 1 1 0

  • 2022-06-04 问题

    文法G&#91;N&#93;为:N→D|ND D→0|1|2|3|4|5|6|7|8|9 G&#91;N&#93;的语言是什么? A: L(G[N])={[img=23x19]180344213df2ad7.png[/img] | V∈ {0,1,2,3,4,5,6,7,8,9},n>=1} B: L(G[N])={非负整数} C: L(G[N])={允许0 开头的非负整数} D: L(G[N])={[img=23x19]180344213df2ad7.png[/img] | V∈ {0,1,2,3,4,5,6,7,8,9},n>=0}

    文法G&#91;N&#93;为:N→D|ND D→0|1|2|3|4|5|6|7|8|9 G&#91;N&#93;的语言是什么? A: L(G[N])={[img=23x19]180344213df2ad7.png[/img] | V∈ {0,1,2,3,4,5,6,7,8,9},n>=1} B: L(G[N])={非负整数} C: L(G[N])={允许0 开头的非负整数} D: L(G[N])={[img=23x19]180344213df2ad7.png[/img] | V∈ {0,1,2,3,4,5,6,7,8,9},n>=0}

  • 1 2 3 4 5 6 7 8 9 10