Cairo University

Faculty of Engineering

Department of Electronics
and Electrical
Communications
Engineering

Advanced Topics in Logic Design

Fourth Year 1434/1435 H (2013/2014) Elective Course - Term 1
Final Exam December 2013 2 Hours

Attempt ALL FOUR Questions

Question 1 Boolean Function Decomposition

, where

a. [8 marks] Given the Boolean function

not depend on the Boolean variable .

Find the simplest expression for each of the following for

i.

The positive cofactor

ii.

The negative cofactor

iii.

The existential quantification

iv.

The universal quantification

and

are Boolean functions that do

with respect to :

a. [10 marks] Complete each of the following statements with one of the following answers:
1.

2.

3.

4.

5.

i.

The total number of distinct n-variable minterms is ________.

ii.

The total number of distinct minterms contained in any 2-literal cube in an n-variable
Boolean functions is ________.

iii.

The total number of distinct n-variable Boolean functions is ________.

iv.

The total number of distinct cubes to represent n-variable Boolean functions is ________.

v.

The total number of distinct cofactors of an n-variable Boolean functions is ________.

Page 1 /2

Question 2 Boolean Satisfiability

a. [9 marks] Use the Davis-Putnam Resolution-Based Algorithm to solve the following SAT problem:
(

)(

)(

)(

)(

)(

b. [9 marks] Use Davis-Logemann-Loveland Depth-First Search Algorithm to solve the SAT problem
given in part (a).
Question 3 Boolean Matching
a. [2 marks] Write an expression for the total number of possible mappings that can be considered when
attempting to find a matching for a pair of n-variable Boolean functions.
b. [2 marks] Can a pair of Boolean functions be matched if their OnSets have different sizes? If so, in
which case that can take place?
c. [2 marks] Can a pair of Boolean functions be matches if they have different number of unate and
binate variables?
d. [4 marks] Compute the Unateness and the Size of the Onset signatures of the pair of Boolean
functions

and

.
e. [8 marks] Find a possible matching for the pair of functions given in part (d) if it exists.
Question 4 Reduced Ordered Binary Decision Diagrams
a. [2 marks] Write the logic expression of the if-then-else (ITE) operator ITE(
Boolean functions , , and .

) in terms of the

b. [6 marks] Show how the ITE operator can be used to represent each of the following composite
Boolean expressions:
i.
ii.
iii.
c. [4 marks] Sketch the ROBDD representation of an -input XNOR Boolean function, and show that it
has levels and (
) nodes for any
.
d. [6 marks] Sketch the ROBDD representation of the Boolean function
with the variable ordering

Page 2 /2