UIT2201: CS & the IT Revolution
Tutorial Set 6 (Spring 2008)

(D-Problems discussed on Thursday, 06-Mar-2008)
(Q-Problems due on Tuesday, 11-Mar-2008)


Practice Problems: (not graded)
(If you have difficulties with these PPs, please see your classmates or the instructor for help.)

T6-PP1: (Binary Representations) Problems 1, 2, 5 of Section 4.2.1 of [SG3].
T6-PP2: (Simple Logic Circuit) Problems 2 on Section 4.4.2 of [SG3].


Discussion Problems: -- Prepare (individually) for tutorial discussion.

Review of Spring 2007 Quiz 1: [here]
    Question 2 -- (Hybrid Searching Algorithms)
    Question 3 -- (Database Query)

T6-D1: (Binary Representations)
For [SG3] Problem 1(b), 3(a), 5(b), 8(b), 9(b) on p.184 of (Ch 4).

T6-D2: (ASCII and UNICODE encoding)
How many binary digits (or bits) would it take to represent the following phrase

"Computer Science and the IT Revolution"
(a) in ASCII code, and (b) in UNICODE? (Do not include the surrounding "" marks.)

T6-D3: (Simple Logic Circuit)
Consider the output Z in the truth table below.
(a) Write out a logical formula for Z as sum-of-products.
(b) Simplify the formula (from (a)) as much as you can.
(c) Design a circuit that implements Z.
   a   b | Z
  -------+---
   0   0 | 1
   0   1 | 1
   1   0 | 0
   1   1 | 1

T6-D4: [Boolean Logic Laws]
Using truth tables, prove the following logical law (DeMorgan's Law).
        ~(P+Q) = (~P)*(~Q)


Problems to be Handed In for Grading by the Deadline:
(Note: Please submit hard copy to me. Not just soft copy via email.)
[Simple Problems after the Quiz]

T6-Q1: (10 points) (Binary Representations)
For [SG3] Problem 1(a)(c), 3(b)(c), 5(a)(c), 8(a)(c), 9(c)(d) on p.184 of (Ch 4).

T6-Q2: (10 points) [Boolean Logic Laws]
Using truth tables, prove the following logical laws.
        1. ~(P*Q) = (~P)+(~Q)               [DeMorgan's Law]
        2. X*(Y+Z) = (X*Y)+(X*Z)           [Distributive Law]
(Note: In these html-pages, we use * to represent logical AND operation, + to represent logical OR operation, and ~ to represent logical NOT operation.)

T6-Q3: (10 points) (Logic Design) [From USST01 Exam Nov 2001]
Give a logic circuit and the truth table corresponding to the following logical formula:
        ( (A*B) + (~(C*B)) )


UIT2201: CS & IT Revolution; (Spring 2008); A/P Leong HW