AABBCDA AABBCD Pop() AABBC Pop() AABBCA Push(A) AABBCAE Push(E) AABBCA Pop() AABBCAD Push(D) AABBCA Pop() AABBCAA Push(A) ans: AABBCAA, assume the top is end of the list

all paths of length 3 from E to B: EADB EAEB C to B: CCCB CBCB CCDB or A to B: AEAB AEDB ABCB

The expression that matches this truth table: A*(B + C) + ~A*B*C

= ~A + B + ~C * ~D

correction: = ~ ~ (A + B*C) * ~ ~(A*~B) = (A + B*C) * A * ~B = (A + A * B * C) * ~B = A * ~B

~ ( ~(A + B*C) + ~(A * ~B)) = ~(~A * (~B + ~C) + ~A + B ) = ~( ~A * ~B + ~A * ~C + ~A + B) = ~(~A*~B) * (A + C) * A * ~B = (A + B) * (A +C) * A * ~B =(A + A*C + B*A) * A * ~B = (A + A*C + A* B) * ~B =A*B~ + A*C*B

Thank you for sharing this list!

1. Convert 5 * 8 / 2 ^ 2 + 4 * 6 to postfix and prefix notation postfix = 5 8 * 2 / 2 ^ 4 6 * + prefix = + ^ / * 5 8 2 2 * 4 6 1. Evaluate the prefix expression: * * + 2 5 * 9 0 ^ 3 2 = * * 7 0 1 = * 0 1 = 0 1. Evaluate the postfix expression: 5 6 * 3 5 * - 2 2 ^ * = 30 3 5 * - 0 * = 30 15 - 0 * = 15 0 * = 0 BONUS: Find the value of X (this time there is only 1 answer!) in the following postfix equation: 5 6 - X * 2 + = -7 ==> -1 X * 2 + = -X 2 + = -X +2 = -7 ==> X = 2 + 7 = 9 Jerry

I am Jerry

LSHIFT-2(10011 XOR 00110) OR (LCIRC-2(RCIRC-2(10001))) = 10101 ( (RSHIFT-3(01000) XOR NOT(00110) ) AND (01101 OR RCIRC-2(10011)) = 11000, manual = ????? X AND 11010 = 01000, find all X 01000 01001 01100 01101

Binary: 100 100+110101=1110001 Octal: 444 444-177=245 Decimal: 122*21=99E in Hexidecimal Hexidecimal:99E 99E/2A, the quotient is 3A*2A Remainder is 1A

random number 397 binary: 110001101 octal: 615 hexadecimal 18D private static String convert(int n, int b) { StringBuilder sb = new StringBuilder( ); int mask = 0; for (int i = 0; i < b; i++) { mask |= 1 << i; } while (n > 0) { int digit = n & mask; n = n>>b; if (digit < 10) { sb.insert( 0, digit ); }else { char c = (char)('A' + (digit-10)); sb.insert( 0, c ); } } return sb.toString(); }

// By Jerry Yi public boolean scoresIncreasing(int[] scores) { for (int i = 1; i < scores.length; i++) { if (scores[i] >= scores[i-1]) continue; else return false; } //passed all checks >= return true; }