Download CS 303 LOGIC DESIGN FINAL EXAM and more Summaries Logic in PDF only on Docsity!
INTERNATIONAL UNIVERSITY OF SARAJEVO
JANUARY 2014.
CS 303 LOGIC DESIGN
FINAL EXAM
STUDENT NAME:
DATE:
QUESTION
1 2 3 4 5
POINTS /12 /30 /21 /10 /
TOTAL /
Instructions:
- Examination time: 120 min.
- Write your name and student number in the space provided above.
- This examination is closed book.
- There are 5 questions. The points for each question are given in the square brackets, next to the question title. The overall maximum score is 100. This final exam weighs 40 % of your final grade.
- Answer each question in the space provided. If you need to continue an answer onto the back of the sheet, indicate that and label the continuation with the question number.
- Show all work in order to get full credit. Indicate clearly your final answers.
- Good luck and no cheating – I will know.
1. Mark the correct answer(s) (12 %)
1.1 What is the minimum number of flip-flops needed to build a mod-12 synchronous counter (counts from 0 to 11)? [3] a) 1, b) 2, c) 3, d) 4.
1.2 How many different input conditions will produce a HIGH output on a three-input OR gate? [3] a) 3, b) 5, c) 8, d) 7.
1.3 The main difference between a Mealy State Machine and a Moore State Machine is [3] a) A Mealy Machine has more flip-flops b) A Moore Machine uses only J-K flip-flops c) The output logic on a Moore machine has only one output d) Not any of the above
1.4 What type of shift register is shown below? [3]
a) SISO, b) SIPO, c) PISO, d) PIPO,
2.4 Complete the timing diagram below for the D flip-flop. [ 8 ]
3. Boolean algebra (21 %)
3.1 What is the simplest Boolean expression for the circuit shown below [4]
3.2 What is the simplest Boolean expression for the circuit shown below [5]
3.3 What function F(x,y,z) is implemented in the figure to the right? You may answer using the minterm notion. [6]
F(x,y,z) =
[6]
3.4 Simplify the expression using Boolean algebra and/or Karnaugh maps: [6] F(A, B, C, D) = BC ’ + D’ (A + B’) + BCD + A’BC
4. Number systems (10 %)
4.1 Complete the following table (except the shaded cells) of equivalent values [6]
Binary Octal Decimal Hexadecimal
73 248
4.2 Find the base X if (^202) (X) = 10100100(2) [4]
5. State machine design (27 %)
Consider the state diagram below.
5.1 Finish the state table given below! (One F-F type is enough) [9] [10]
5.2 Write the input equations for D, JK and/ or T flip-flops! [9] [15]
5.3 Choose FFs to implement the machine and draw the logic diagram! [9] [10]
