Binary and Hexadecimal Expansions - Show that the binary expansion of a positive integer can be obtained from its hexadecimal expansion by translating each hexadecimal digit into a block of four binary digits.
Factoring - a.
Convert (11101)2 to base 16.
b.
Use the Euclidean algorithm to find gcd(34,21).
Discrete Structures - 1) If f is the mod-5 function, compute each of the following.
a) f(17)
b) f(48)
c) f(169)
3) Convert (1011101)2 to base 16 (i.e., hex)
4) Find the sum of products expansion of this Boolean fu ...
Boolean Algebra : Gates, Truth Tables and Logic Operations - (See attached file for full problem description)
---
For question #1, just use the example to show how to solve a problem like it is.
1. Gates Implement the 1 bit full adder using only:
1. 2 ...