Problem 5

1.
Problem 5
2.
Problem 6
1. G
Problem 6
𝐵 × 2 , 𝑙𝑒𝑓𝑡 𝑠ℎ𝑖𝑓𝑡 608, 𝑙𝑒𝑓𝑡 𝑠ℎ𝑖𝑓𝑡
2. (1) 𝑌 = (2) A = 4, B = 38, 𝑌 = .
𝐵 × 2 , 𝑟𝑖𝑔ℎ𝑡 𝑠ℎ𝑖𝑓𝑡 2, 𝑟𝑖𝑔ℎ𝑡 𝑠ℎ𝑖𝑓𝑡

(38)10=32+4+2=2^5+2^2+2^1

The binary representation of 38 (B) is ‘0000 0000 0010 0110’. The left shift operation moves the bits towards the
left by 4 positions and fills the empty positions with zeros.
The result is ‘0000 0010 0110 0000.’ Y= 2^9+2^6+2^5=608
The right shift operation shifts the bits towards the right and fills the empty positions with zeros.
The result is ' 0000 0000 0000 0010.’ Y=2^1=2.
Left shifting a binary number by a certain number of positions effectively multiplies the number by 2 raised to the
power of the shift amount, while right shifting divides the number by 2 raised to the power of the shift amount,
discarding the remainder.
 Problem 7
1. p.f.=0.5 V=240V, f=60Hz, 𝜔 = 2𝜋𝑓 = 376.9911 2.

L=51mH, 𝑥 = 2𝜋𝑓𝐿 = 𝜔𝐿 = 19.2265 

𝑅= = 11.1004 
. .

Z = 𝑅 + 𝑗𝑥 = 11.1004 + j19.2265 

S= ∗ = 11.1004 − j19.2265=1.2972×10 +j2.2469 ×10 VA

P= 1.2972 kW

The capacitor’s power rating: - Q= - 2.2469 kVAR

2.2469×
C= = × . = 1.03474 ×10 F=103.474µF

2. The results of Questions 2 align with those of Question 1.

Problem 7
2. A possible solution:
Remember: You need to document your code with comments and by appropriately naming terminals.
Problem 7
3. Create a table to list the calculations,
Problem 8
8.1