Order from slowest to fastest the following functions a) 6n2, b) n log 6 n, c) 6n3 ,, d) log2 n e) 4n, f) log 8 n, g) 64

Simplify following Boolean Expressions using Quine-McClukey tabular method. F(A,B,C,D,E,F)=Em(6,9,13,18,19,25,27,29,41,45,57,61)

MATLAB/Octave

1| Rev 001 Eff Date: 09-08-2023 QP-ASR-001 | Rev 001 Eff Date (b) Draw a logic circuit diagram of the following Boolean expression: i. AB+C+ACB+B ii. ABC + ABC + AC (c) Convert the following expression to sum-of-product form F(A, B, C) AB + BC + AC Question 3: [Total Marks: 10] [5 marks] [5 marks] [5 marks] (a) Draw the logic circuit diagram for the following Boolean expressions using only NAND Gates X= AB (b) Draw the logic circuit diagram for the following Boolean expressions using only NOR Gates X=AB Question 4: [Total Marks: 10] (a) What is the Control word for the following micro-operations? [6 marks] i. R1 <- R2 + R3 ii. R2 <- SHR R2 Page 2 of 3 iii. R7 <- R2-R3 (b) The following instructions are performed in a processor based on general register organization. If R1 = 1001 and R2 = 1101, what will be the value of register R2 in the following operations: i. R2 <- SHR R2 ii. R2 <- R2 + R1 [4 marks] Question 5: [Total Marks: 15] Given the expression (A+B)*(C-D)+(E/F*G) (a) Find the…

Transform the following infix expressions into their equivalent postfix expressions 1. (A-B)* (D/E) 2. ((300+23)*(43-21))/(84+7))

Matlab code Code for Hermite polynomials using divided differencesWith an example of computing the Hermite polynomial of degree 5, f(1.5)

2. RADIOACTIVE DECAY, REVISITED This is a modified version of chapter 1 problem 4 in your textbook. Consider the radioactive decay of nuclei A into nuclei B, which can then also decay. The numbers of each species as a function of time are given by N₁ (t) and NB (t), and the decay of each species is governed by¹: dNA dt == NA dNB NA NB = dt ΤΑ TB where T and T are the decay time constants for each type of nucleus.

One way to generate the value of Eulers number e is given by the formula   e=limn→∞(1+1/n)^n   Complete the code that calculates the expression inside the limit, that is, (1+1/n)^n, for some value n.

Hardware & Architecture HW #5-100 Pts 1. (25 Pts - 5 Pts Each) Reduce the following expressions using Boolean Algebra a) A+ ABC + AB b) ABC + ABC + C c) ABC + ABC + ABC d) AC + AB+ AB e) (A + B)C + (CD) + B 2. (6 Pts) Prove that AB + B = A + B using a truth table. Input combinations must be sequential. A B B AB AB + B A+ B Explain how this proves the relationship.

Simplify the following expressions: (a) A+ AB + ABC (b) (А+ B)C + АBС (с) АВС(BD + CDE) + AC (d) (A+ B)(A+ B) (e) AC+ ABC (f) ABCD+ ABCD (g) (A+ B)(A+ B+ D)D (h) AC(ABD)+ ABCD+ ABC (i) ABC + ABC+ ABC