C 3 Int Jan
C 3 Int Jan
1. Boolean Algebra 1.
How many ordered triples make the following expression TRUE?
2. Graph Theory A B C D 2.
Given the adjacency matrix, A 1 0 1 1
draw the directed graph. B 0 1 1 0
C 1 0 1 0
D 1 1 1 1
3. Graph Theory 3.
How many paths of length 2
exist from vertex B in this
directed graph?
4. Digital Electronics 4.
Which ordered
triples make this
circuit FALSE?
5. Digital Electronics 5.
Simplify the
Boolean
expression that this
circuit represents.