Boolean algebra:
Simplify these expressions:
How many inputs are true for the following expressions?
Answers:
!ABC
B!D + A!BC
B!C + AB
BC + !A!B!C
3
15
4
Data Structures:
What is popped next in this queue?
PUSH(D), PUSH(F), POP(X), PUSH(G), POP(X), POP(X), PUSH(H), PUSH(J), PUSH(K), POP(X), PUSH(Q), POP(X), PUSH(Q), PUSH(W), POP(X), POP(X), PUSH(Q), PUSH(Q), POP(X), PUSH(Q), PUSH(Y), POP(X), PUSH(C), POP(X), PUSH(T), PUSH(A), POP(X), POP(X), PUSH(J), POP(X)
PUSH(A), POP(X), PUSH(G), PUSH(U), PUSH(B), PUSH(X), POP(X), POP(X), PUSH(X), PUSH(L), POP(X), PUSH(P), POP(X), PUSH(S), PUSH(R), POP(X), POP(X), PUSH(R), PUSH(R), PUSH(H), POP(X), PUSH(N), PUSH(Z), PUSH(U), POP(X), POP(X), POP(X), PUSH(W), PUSH(E)
What is popped next in this stack?
PUSH(D), PUSH(F), POP(X), PUSH(G), POP(X), POP(X), PUSH(H), PUSH(J), PUSH(K), POP(X), PUSH(Q), POP(X), PUSH(Q), PUSH(W), POP(X), POP(X), PUSH(Q), PUSH(Q), POP(X), PUSH(Q), PUSH(Y), POP(X), PUSH(C), POP(X), PUSH(T), PUSH(A), POP(X), POP(X), PUSH(J), POP(X)
PUSH(A), POP(X), PUSH(G), PUSH(U), PUSH(B), PUSH(X), POP(X), POP(X), PUSH(X), PUSH(L), POP(X), PUSH(P), POP(X), PUSH(S), PUSH(R), POP(X), POP(X), PUSH(R), PUSH(R), PUSH(H), POP(X), PUSH(N), PUSH(Z), PUSH(U), POP(X), POP(X), POP(X), PUSH(W), PUSH(E)
What is the depth of these binary trees?
NOTEBOOK
HONOLULU
MARIACHI
MYNAMEJEF
Answers:
C
R
Q
E
3
4
5
5