ECE 109 Problem Sessions -- Sections 602, 604, and 605
Not for ECE 109 Section 002
Students in ECE 109 section 002 will attend the problem
sessions in Raleigh. Only the Asheville, Havelock, and Wilmington students
should pay attention to this page.
Problem set 1 -- 31 January
Students attending "remotely" need to turn in the following
problems by class next Tuesday. It is OK to work in groups.
It is also recommended that you look at the following problems.
Problem set 2 -- 7 February
Students attending "remotely" need to turn in the following two
problems by class next Tuesday. Again, it is OK to work in groups.
Create a gate level circuit for the following truth table:
A |
B |
C |
Out |
0 | 0 | 0 | 0 |
0 | 0 | 1 | 0 |
0 | 1 | 0 | 0 |
0 | 1 | 1 | 0 |
1 | 0 | 0 | 1 |
1 | 0 | 1 | 1 |
1 | 1 | 0 | 1 |
1 | 1 | 1 | 0 |
Also, translate the following Boolean expression into both
a truth table and a gate-level circuit.
- (NOT(A) OR NOT(B)) AND (A OR B)
Problem set 3 -- 21 February
Problem set 4 -- 28 February
Do the following five problems.
- Problem 5.7 from the textbook.
- Problem 5.8 from the textbook.
- Problem 5.11 from the textbook.
- Write a sequence of LC-3 instructions to perform
R3 → R1 OR R2.
- Write a sequence of LC-3 instructions to perform
R3 → R1 - R2.
Problem set 5 -- 13 March
Problem set 6 -- 20 March
Do the following three problems from the textbook.
- Problem 5.25
- Problem 5.32, but with the replacements shown below
- x3050 0000 0010 0000 0010
- x3051 0101 0000 0010 0000
- x3052 0000 1110 0000 0010
- x3053 0101 0000 0010 0000
- x3054 0001 0000 0011 1111
- Problem 5.33, but add the following instruction at the beginning
of the program
- x2FFF 0101 0000 0010 0000
Problem set 7 -- 27 March
Problem set 8 -- 10 April
Problem set 9 -- 17 April
Do the following four problems from the textbook.
- Problem 9.13
- Problem 9.18
- Problem 8.9
- Problem 8.10