This was prepared by Dr. Allaaeldin Amin.

KING FAHD UNIVERSITY OF PETROLEUM & MINERALS
COLLEGE OF COMPUTER SCIENCES & ENGINEERING

COMPUTER ENGINEERING DEPARTMENT

COE 200 Fundamentals of Computer Engineering
Syllabus - Term 021

Catalog Description

Introduction to Computer Engineering. Digital Circuits. Boolean algebra and switching theory. Manipulation and minimization of Boolean functions. Combinational circuits analysis and design, multiplexers, decoders and adders. Sequential circuit analysis and design, basic flip-flops, clocking and edge-triggering, registers, counters, timing sequences, state assignment and reduction techniques. Register transfer level operations. (Prerequisite: PHYS 102)

 

Instructor

Ashraf S. Hasan Mahmoud

Room  22-144

Phone: 1724

e-mail:

ashraf@ccse.kfupm.edu.sa

Class

Time   10:00- 10:50

SMW

Location

Room  24-273

Office Hours:   Sat/Mon/Wed 11:00-11:50 am & 2:00-2:50 pm, and by appointment.

Text Book:     Morris Mano and Charles Kime, Logic and Computer Design Fundamentals, Second Edition, Prentice Hall International, 2000.

Grading Policy:                                  Laboratory                                         20%

                                                                  Class work & Quizzes                         15%

                                                                  Exam I                                                15%

                                                                  Exam II                                                20%

                                                                  Final                                                     30%

Course Topics

Week

Class #
Subject

Ref

Number System and Codes

1

 

1.                    

Introduction. Information Processing, and representation. Digital vs Analog

1.1

2.                    

Number Systems. Binary, octal and hexadecimal numbers

1.2, 1.3

2

 

 

3.                    

Number base conversion (Dec to Bin, Oct, and Hex, General)

1.3

4.                    

Conv (Bin, OCT, Hex), Binary & other System Arith.

1.3

5.                    

Signed Binary Number representation, Signed Mag, R’s &(R-1)’s Complement

Handout

3

 

 

6.                    

Signed Binary Addition and Subtraction. R’s &(R-1)’s Complement

Handout

7.                    

Signed Binary Addition and Subtraction. R’s &(R-1)’s Complement

Handout

8.                    

Codes.  BCD, Excess-3, Parity Bits, ASCII & Uni-Codes

1.4, 1.5, Handout

Binary Logic & Gates

4

 

 

9.                    

Binary logic and gates, Boolean Algebra, Basic identities of Boolean algebra.

2.1, 2.2

10.                   

Boolean functions, Algebraic manipulation, Complement of a function.

2.2

11.                   

Canonical and Standard forms, Minterms and Maxterms, Sum of products and Products of Sums.

2.3

 

5

 

12.                   

Map method of simplification: Two-, Three-, and Four-variable K-Map.

2.4

13.                   

Map method of simplification: Five, and Six-variable K-Map.

Handout

6

 

 

14.                   

Map manipulation: Essential prime implicants, Nonessential prime implicants, Simplification procedure.

2.4

15.                   

Don’t care conditions and Simplification

2.5

16.                   

Universal gates; NAND and NOR gates: 2-level implementation.

2.6

7

 

17.                   

Multilevel NAND Circuits.

2.6

18.                   

Exclusive-OR (XOR) and Equivalence (XNOR) gates, Parity generation and checking.

2.7

Combinational Logic

 

19.                   

Combinational Logic, Design procedure. BCD-to-Excess 3 code Conversion.

3.4

8

 

 

20.                   

BCD-to- 7 Seg. Display. Half and Full Adders.

Partial 3.4, 3.8

21.                   

Design using MSI parts. Decoders, Decoder Expansion. Combinational Circuit implementation using decoders.

3.5

22.                   

Encoders & Priority Encoders Magnitude Comparator.

3.6, Handout

9

 

 

23.                   

Multiplexers. Function Implementation using multiplexers, Demultiplexers

3.7

24.                   

Binary Adders: 4-Bit Ripple Carry Adder, Carry Look-Ahead Adder, Binary Adder-Subtractor.

3.8, 3.10

25.                   

BCD Adder, Binary Multiplier.

3.11, 3.12

Sequential Circuits

10

 

26.                   

Sequential Circuits: Latches, SR and D-latch, Clocked latch.

4.1, 4.2

27.                   

Flip-Flops: Master-Slave, Edge-Triggered. Timing Diagrams

4.3

11

 

 

28.                   

Flip-Flops Characteristic & Excitation Tables: D-FF, SR-FF, JK-FF, T-FF.. Asynchronous/Direct Clear and Set Inputs

4.3

29.                   

Setup, Hold, Enable times. Timing control and Clocks. Path delay constraints.

Handout

30.                   

Sequential Circuit Design: Design procedure, Construction of state diagrams and state tables.

4.5

12

 

 

31.                   

Designing with D-FFs. Designing with unused states.

4.6

32.                   

Designing with JK-FFs, Flip-Flop

4.7

33.                   

Sequential Circuit Design Examples.
 

13

34.                   

Sequential Circuit Analysis: Input equations, State table.

4.4

Registers & Counters

 

 

35.                   

Registers, Registers with parallel load, Shift Registers.

5.2, 5.3

36.                   

Shift register with parallel load, Bi-directional shift register.

5.3

14

 

 

37.                   

Ripple Counters: Up-Down Counters. Synchronous Binary Counters: Counters with JK-FF, Counters with D-FF.

5.4

38.                   
Serial and Parallel Counter, Up-Down Binary Counter, Binary Counter with Parallel Load.

5.5

39.                   

Other Counters: BCD Counter, Arbitrary Count Sequence.

5.5

Memory & PLDs

15

 

 

 

40.                   

Memory and Programmable Logic Devices: Read-Only Memory.

6.1, 6.7

41.                   

Combinational Circuit Implementation with ROM.

6.7

42.                   

Programmable logic Array, Programmable Array logic. Programmable Logic Devices and FPGAs

6.8, 6.9