386. The Boolean function Y = AB + CD is to be realized using only 2- in put NAND gates. The minimum number of gates required is
A.2
B.3
C.4
D.5

---

387. The Boolean expression Y = -A- if C D+ ABCD +Alt- -eD+AB-e 15 can be minimized to
A.Y= X Ti UD+ ABC +ATD
B.Y= X B TD+BCE +A13- -ED
C.Y= XBC15 + B TD+Alli "ED
D.Y= XBC15 + B UD+AB-E 15

---

388. An 8085 assembly language program is given below Line 1: MVIA, B5H 2: MVI B, OEH 3: XRI 69 H 4 :ADD B 5 :ANI 9BH 6: CPI 9IFH 7 : STA 3010H 8: HLT I. The contents of the accumulator just after execution of the ADD instruction in line 4 will be
A. C3H
B. EAH
C. DCH
D. 69H

---

389. IL After execution of line 7 of the program, the status of the CY and Z flags will be
A. CY = 0, Z = 0
B. CY = 0, Z =1
C. CY = 1, Z = 0
D. CY = 1, Z = 1

---