The answers are as follows:
a) F(A, B, C) = A'B'C' + A'B'C + A'BC' + A'BC + AB'C' + AB'C + ABC' + ABC
= A'(B'C' + B'C + BC' + BC) + A((B'C' + B'C + BC' + BC)
= (A' + A)(B'C' + B'C + BC' + BC) = B'C' + B'C + BC' + BC
= B'(C' + C) + B(C' + C) = B' + B = 1
b) F(x1, x2, x3, ..., xn) = ∑mi has 2n/2 minterms with x1 and 2n/2 minterms
with x'1, which can be factored and removed as in (a). The remaining 2n1
product terms will have 2n-1/2 minterms with x2 and 2n-1/2 minterms
with x'2, which and be factored to remove x2 and x'2, continue this
process until the last term is left and xn + x'n = 1
Answer:
To create a console that is suitable for children and families.
Answer:
A. Spoofing
Explanation:
Spoofing is the act of disguising a communication from an unknown source as being from a known, trusted source. Spoofing can apply to emails, phone calls, and websites, or can be more technical, such as a computer spoofing an IP address, Address Resolution Protocol (ARP), or Domain Name System (DNS) server.
IP spoofing involves an attacker trying to gain unauthorised access to a system by sending messages with a fake or "spoofed" IP address to make it look like the message came from a trusted source, such as one on the same internal computer network, for example.
Email spoofing often involves things like requests for personal data or financial transactions. The emails appear to be from trusted senders such as customers, coworkers, or managers but they are actually from cyber criminals who deliberately disguise themselves to gain your trust and your help with the action they want you to take
Answer:
In assembly language, two instructions control the use of the assembly language procedure.
CALL pushed the control to the return address onto the stack and transferred the control.
RET instruction returns the address that placed on the stack by a call instruction.
Explanation:
Action RET instruction
- The RET instruction pops the address and returns off the stack, which is pointed by the stack pointer.
- The stack is LIFO in memory at a particular location, and the pointer points offset from the stack location.
RET instruction does its job by consulting the register and memory state at the point when it is executed.
In RET instruction, only register and memory state is executed. Call instruction must save that address that figure out in a register and memory location.
def dx(fn, x, delta=0.001):
return (fn(x+delta) - fn(x))/delta
def solve(fn, value, x=0.5, maxtries=1000, maxerr=0.00001):
for tries in xrange(maxtries):
err = fn(x) - value
if abs(err) < maxerr:
return x
slope = dx(fn, x)
x -= err/slope
raise ValueError('no solution found')
