Question Purpose: The purpose of this labwork is to practice arithmetic operations in M6800 assembly language programming. 1) Write an assembly language program which implements the following arithmetic operations: \[ \begin{array}{l} x=x * 3 \\ y=y / 8 \\ x=(x * 5)-(y * 7) \end{array} \] *You should store \( x \) in the address \( 50 \mathrm{H} \) and \( y \) in the address \( 60 \mathrm{H} \). 2) Run your code with the following data and write a report explaining the results. In each case, convert your results into decimal and write if it is correct or not. If it is not correct, explain the reasons. a) \( x=5, y=20 \) b) \( x=10, y=24 \) c) \( x=1, y=40 \)

Using Matlab, create a step by step solution for the problem given below 1.) Create a low pass FIR filter with 6th order filter, cutoff frequency of 1000Hz and sampling frequency of 11025Hz. Determine the filter coefficients. Plot the poles and zeros of the filter, its impulse response, and its freq response.

Derive the truth table, simplified Boolean function (equation), and draw the logical diagram. 1. F(A,B,C)= [ (0,1,4,5,6,) 2. F(w,x,y,z) = {(1,3,4,7,10,12,13,15) 3. F(x,y,z) = 1 (1,3,4,5,7) 4. F(w,x,y,z) = T (0,1,4,5,6,8,9,11,12,14,15) 5. Implement using NAND-NAND, F= B'+CD'(A+B)+A'BC

Write in a 1 whole sheet of yellow paper. Derive the truth table, simplified Boolean function (equation), and draw the logical diagram. 1. F(A,B,C)= [ (0,1,4,5,6,) 2. F(w,x,y,z) = {(1,3,4,7,10,12,13,15) 3. F(x,y,z) = T (1,3,4,5,7) 4. F(w,x,y,z) = T (0,1,4,5,6,8,9,11,12,14,15) 5. Implement using NAND-NAND, F= B'+CD'(A+B)+A'BC

Solve both please Two ideas pouring where are stacked so that none of the incident unpotarted light is transmitted. A third polarizing sheet is slipped between the first two sheets such at 10 percent of incident light is transmited through the stack. Find the angle of the third polarizing sheet 58 degrees 39 2 egrees 10 6 cegrees 11 5 degrees A block of mass 10 kg is attached to a spring of spring constant 1000 Nm. Block is pulled by 15 cm downwards (Point A) from its equilibrium position and released. In case 1) block now performs a SHM. In case 2) spring is cut when it was at its natural length and the block was moving upwards (during SHM). Find the difference of time taken by the block reaches to point A in case 1 and case 2. (Take g = 10 m/s/s)

1.[3 marks] Evaluate: ∫ ∫ ∫E z(x2 + y2 + z2)-3/2 dV where E is the region satisfying the following inequalities: x2 + y2 + z2 ≤ 16, z ≥ 2.

Problems 3.2(e,f), 3.4(e,f), 3.5(b,c), 3.6(c,d), 3.10(a,b), 3.11, 3.12(b), 3.15(a,c) 140 Chapter 3 Gate-Level Minimization Problems 141 3.4 Simplify the following Boolean functions, using K-maps: (a) F(x,y, z) (2,3.6,7) (c)' F(A,B,C,D)=Σ(3,7, ll, 13, 14, 15) (e) F (w, x, y, z) = Σ(11, 12, 13, 14, 15) (g) F(w, x, y, z)=E(0.1.4,5,10,1 1,14,15) Simplify the following Boolean functions, using four-variable K-maps: (a)" F (w, x, y, z) = Σ(1, 4, 5, 6, 12, 14, 15) (b)" F (A, B, C, D) = Σ(2, 3, 6, 7, 12, 13, 14) (c) F (w, x, y, z) = Σ(1, 3, 4, 5, 6, 7, 9, 1 1, 13, 15) (d)' F (A, B, C, D) = Σ (0, 2, 4, 5, 6, 7, 8, 10, 13, i5) Simplify the following Boolean expressions, using four-variable K-maps: (a) A'B'C'D AC'D' B'CDA'BCD BCD (by (d)' (f) (h) F (A, B, C, D) = Σ(4. 6, 7, 15) F(w.rry, z)_E(2.3. I2. 13, 14, 15) F (w, x, y, z)-S(8, 10, 12, 13.4) F(w, x, y, z)-E(2.3.6.7.8.9.12,I3) UDP 02467 3.5 FIGURE 3.40 Schematic for Circuit with UDP_02467 3.6 Although Verilog HDL uses this kind of description for UDPs only, other HDLs and computer-aided design (CAD) systems use other procedures to specify digital circuits in tabular form. The tables can be processed by CAD software to derive an efficient gate structurc of the design. None of Verilog's predefined primitives describes sequential logic. The model of a sequential UDP requires that its output be declared as a reg data type, and that a column be added to the truth table to describe the next state. So the columns are organized as inputs: state: next state. (c) A'B'CD AB'D +A'BC ABCD AB'C (d) A'B'C'D' BC'D A'C'D A'BCD +ACD' Simplify the following Boolean expressions, using four-variable K-maps: 3.7 In this section, we introduced the HDLs and presented simple examples to illustrate alternatives for modeling combinational logic. A more detailed presentation of model- ing with HDLs can be found in the next chapter. The reader familiar with combinational circuits can go directly to Section 4.12 to continue with this subject. (c) AB C B'C'DBCD ACD'+ A'B'C+ A BC D Find the minterms of the following Boolean expressions by first plotting each function in a K-map: 3.8 (a) xy yz + xy'z (b) C'D+ABC ABD' +A'B'D (d) A'B A'CD B'CD BC'D VHDL-Truth Tables 3.9 Find all the prime implicants for the following Boolean functions, and determine which are essential: (a)" F(w, x, y, z) = Σ(0, 2, 4, 5, 6, 7, 8, 10, 13, 15) (b), F (A, B, C, D) = Σ(0, 2, 3, 5, 7, 8, 10, 11, 14, 15) (c) F (A, B, C, D) = Σ(2, 3, 4, 5, 6, 7, 9, 11, 12, 13) (d) F(w,x, y, z)=E(1.3, 6, 7, 8, 9, 12, 13, 14, 15) (e) F (A, B, C, D) = Σ(0, 1, 2, 5, 7, 8, 9, 10, 13, 15) (f) F(w, x, y, z)=E(0.1, 2, 5, 7, 8, 10, 15) Simplify the following Boolean functions by first finding the essential prime implicants: (a) F (w, x, y, z) 2(0, 2, 5, 7, 8, 10, 12, 13, 14, 15) (b) F(A, B,C, D) 2(0,2,3,5,7,8,10, 11, 14, 15) (e)* F(A, B,C,D)-(1,3,4,5, 10, 11, 12, 13, 14, 15) (d) F (w, x, y, z) = Σ(0, 1, 4, 5, 6, 7, 9, 11, 14, 15) (e) F (A, B, C, D)-Σ(0.1, 3, 7, 8, 9, 10, 13, 15) (f) F (w, x, y, z) = Σ(0, 1, 2, 4, 5, 6, 7, 10, 15) VHDL does not support truth tables directly. Instead, a truth table has to be converted into a set of Boolean equations, which can be described by signal assignment statements. PROBLEMS (Answers to problems marked with appear at the end of the text.) 3.10 1 Simplify the following Boolean functions, using three-variable K-maps: (a) F(x, y, z) = Σ (0, 2, 4, 5) (c) Fr, y, )-20,1,2,3, 5) (b) F(x,y, z)-2(0, 2, 4, 5, 6) (d) , y, z)=E(1,2,3,7) 2 Simplify the following Boolean functions, using three-variable K-maps: (b)" F(x, y, z) = Σ(1, 2, 3, 6, 7) (d) F(x, y, z) = Σ( 1, 2, 3, 5, 6, 7) (f) F(x, y, z)=E(3, 4, 5, 6, 7) (a)" F(x, y, z) = Σ (0, 1, 5, 7) (c) Fx,y, z) (2,3,4,5) (e) P(x, y, z) = Σ(0,2,4,6) Simplify the following Boolean expressions, using three-variable K-maps: (a)'. F (x.yz) = xy + x'y'z, + χ,yz (c)" F (x, y, z) = x,y + yz' + y,z' 3.11 Using K-maps for Fand F,convert the following Boolean function from a sum-of-prod- 3.3 ucts form to a simplified product-of-sums form. (d) F(x, y, z) = x,yz + xy,z' + xy'z F(w ryz)0,,2, 5,8, 10, 13)