C++程式問題 想問印出來是2,4,5,7,8分開的數字 要怎麼把他變成24578一起的數字 再相減 我打的程式如下

2. 输入不按大小順序的五個個位教,用排序的方法(例如:氣 1 泡排序、選擇排序)排出最大的教與最小的数相减,最後输出運 算過程及結果, 输入:19586 输出:98651-15689-82964 1 9 5 8 6 5S 98651-15689=82962

請問要怎麼看圖填出真值表呢 我知道and or not算法 謝謝

9. For the memory shown in Figure 6, and the initial states of all the memory cells are all 0: AA WEI clock D2 D1 DO WE A1 A0Q2 Q1 QO 1 101 0 00 2 001 1 01 3 111 1 10 4 110 lo 01 S 5 111 1 10 B Figure 6

想請問各位大大 我的算法是對的嗎

VER U. 試求圖 EP3.8a 中,立方結晶面的米勒指數。 解 將此平面沿y軸向右平移量單位,如圖 EP3.86 所示,接著把右後下角當成新原 點,新平面和x軸之截距是1個單位長,所以新平面和各軸之截距是(+1, -, c)。 取其倒數後可寫為(1, -, 0),最後取簡單整數比,得到平面米勒指數 (5120)。 z (1/2 - 1 = 3 - 2 子, 新原點 y X 上 Alw (b) (6)

求解如何算第四題共振電路

- o (a)請求出其轉移函數(transfer unction Hol = 。 (b)請求出錯震頻率(resonance frequency) do (c) 請求出|H(o) | = 1/N2的頻率位置。 (d) 請求出頻寬(band width, BW)為何? L HI = Vs ~ (e) 請求出品質因子(quality factor)為何? 4. 一個並聯共振電路的電感值是30uH,電感線圈電阻是 10 歐姆,電容值是40pF, 期頻率響應之頻寬為何? 9 5. 請繪出高通濾波器與帶通濾波器電路,並請單介紹其訊號選擇之原理。 6. 請找出如下圖函數 g(t) = el 的三角傅利葉級數與 指數傅利葉級數。 | 8(t) KN an - -1.5 -1 -0.5 0 0.5 1.5

大一普物 不知道怎麼計算 求解🙏

30. Review. A 7.80-9 bullet moving at 575 m/s strikes the hand of a superhero, causing the hand to move 5.50 cm in the direction of the bullet's velocity before stopping. (a) Use work and energy considerations to find the average force that stops the bullet. (b) Assuming the force is constant, de- termine how much time elapses between the moment the bullet strikes the hand and the moment it stops moving.

不知道這題要怎麼計算..求解了謝謝

EXAMPLE 2.8 w Calculate the attractive force between a pair of Ba2+ and S2- ions that just touch each other. Assume the ionic radius of the Ba2+ ion to be 0.143 nm and that of the S2-ion to be 0.174 nm.

［計算機組織］ 請問這題的 b. 小題 不同的 processor 不是影響 CPI 的值嗎 為什麼可以拿 a. 算出來的 CPI 直接套在這題？

1.7 [15] Compilers can have a profound impact on the performance of an application. Assume that for a program, compiler A results in a dynamic instruction count of 1.0E9 and has an execution time of 1.1 s, while compiler B results in a dynamic instruction count of 1.2E9 and an execution time of 1.5 s. a. Find the average CPI for each program given that the processor has a clock cycle time of 1 ns. CPI = cycles per instruction 1.1 x 10 cycles for 1.0 x 10° instructions => CPL = 1.1 1.5 X 109 cycles for 1.2 x 109 instructions => CPI = 1.25 b. Assume the compiled programs run on two different processors. If the execution times on the two processors are the same, how much faster is the clock of the processor running compiler A's code versus the clock of the processor running compiler B's code? Execution time = CPI x IC x Cycle Time CPIA X ICA X CTP1 = CP1g x IC3 x CT22 CT P:/CTP2 = (CPIE x ICB)/(CPIA X ICA) = (1.25 X 1.2 x 10°)/(1.1. X 1.0 x 10°) = 1.36 Cycle time P1 = 1.36 x Cycle time P2 => P1 is 36% slower than P2

用節點怎麼算

CHAPTER 4 BASIC NODAL AND MESH AU sepa 92 W our structure answer. Each component of the structure is accessed rately by name as shown. and at node 2 PRACTICE 4.2 For the circuit of Fig. 4.5, compute the voltage across each current source. 212 Unfortunately, we ha is a direct result of the it is not controlled by a equation that relates i In this case, we find 12 w 432 w 3 A 352 52. TA which upon substituti Reference node FIGURE 4.5 and Eq. [10] simplifi Ans: V3A = 5.235 V; v7A = 11.47 V. Solving, we findt The previous examples have demonstrated the basic approach to nodal analysis, but it is worth considering what Thus, the power sup (-60)(-75) = 4.5k

請問一下這題怎麼算😭好難

Vout - 5 volt D2 +5 vol o Vout D OVORI = Vout == 4.310 v ok suming the diodes are | (b) tions shown in Figure P9.23 D -9.3 大 li (c) WO Do V 12 +7 V o bin 88. I won T08 . 9.24 Sketch the output waveform and the voltage transfer characteristic for the circuit of Figure P9.24. Assume an ideal diode, us (t) = & sin (it), V, = XV, Ri = 812, and R2 = $ 12. 10 4 lo lo mm ogiloc www bools boRi t V. -Vo 15 k12 15 k92 1 vs borbo R2 V 4V V c) (d) bagnozib Figure P9.24 OU 29,22, find the range of Vin 25 Repeat Problem 9.24, using the offset diode model

請問有沒有大神會翻成程式碼？ 我看不懂 Sieve algorithm

1.1 What Is an Algorithm? 33 for p 2 to n do A[p] - P for p < 2 to [n] do //see note before pseudocode if A[p]+0 llp hasn't been eliminated on previous passes jr p * P while j < n do A[j]0 //mark element as eliminated j<j+ p I/copy the remaining elements of A to array L of the primes if( 0 for p + 2 to n do if A[p] = 0 L[i] + A[p] iki +1 return L