1)Perform the following Octal addition directly, without converting to another base.
2)Perform the following Hexadecimal addition directly, without converting to another base.
3)Given a list of numbers num[0], num[1], ..., num[N], write an algorithm in pseudo code to find the Minimum value in the list.
4)Briefly explain what Abstraction means. Give two examples (not the erroneous one in the text)
5)What is the lowest base in which 605 would be a valid number?
6)If 11110010 is in 2's complement notation, what signed decimal number does it represent?
7)Convert the decimal number 5.73 to binary. Stop after 4 decimal places. Show your work.
8)Complete the following table. Each row is the same number written in different bases. Each column is the same base. All values are positive.
9)Show the behavior of the following circuit by completing the given truth table with the Boolean Expressions and the corresponding truth values
10)Simplify the Boolean Expression C(AC)' + BC'A' . Show all the steps.
12. A. Consider the following "Super Simple CPU" program. Does it have a Loop? If it does, circle (or write down) the code that causes a Loop.No looping instruction in super simple CPU program and it has only jumping instruction
13. What would be in Mem[13] if the original value of Mem[12] was 8.
14. Consider the following truth table for a circuit where A, B, C are the input and X is the sole output.
|
A
|
B
|
C
|
X
|
|
0
|
0
|
0
|
0
|
|
0
|
0
|
1
|
0
|
|
0
|
1
|
0
|
0
|
|
1
|
0
|
0
|
0
|
|
0
|
1
|
1
|
0
|
|
1
|
0
|
1
|
1
|
|
1
|
1
|
0
|
1
|
|
1
|
1
|
1
|
1
|
16. The Greek alphabet has 25 symbols. How many bits would be required to represent the Greek alphabet?
15. Describe Two Methods to determine if two distinct circuits are equivalent?