BACHELOR OF SCIENCE IN

APPLIED COMPUTER SCIENCE (ACS)

COURSE SYLLABUS
Digital Logic (CS 201)
Credit Hours – 4 [LT(3), LB(3)]
First Semester – Academic Year 2009-2010

Semester - Academic Year

Topics covered in this course include: overview of binary numbers, Boolean algebra, switching
algebra, logic gates, Karnaugh maps, Quin-McCluskey methods, simplification of Boolean functions,
combinational design, two level NAND/NOR implementation, tabular minimization, combinational
logic design,: adders, subtracters , code converters, parity checkers, multilevel NAND/NOR/XOR
circuits, MSI components, design and use of encoders, decoders, multiplexers, BCD adders, and
comparators, latches and flip-flops. Performance enhancements, contemporary architectures. The lab
work is designed to implement and support the theoretical concepts covered in the lectures.
Prerequisite(s): PHYS 101
Co-requisite(s): PHYS 201

Required Textbook(s):
M. Morris Mano and Michael D. Ciletti, “Digital Design” ISBN: 978-0131989245, Publisher:
Prentice-Hall, Inc., Edition: 4th, Year: 2006
Semester - Academic Year
1. David A. Patterson and John L. Hennessy, “Computer Organization and Design: The
hardware/software interface”, ISBN: 978-0123706065, Publishers: Morgan Kaufmann 3rd
Edition, Year 2005
2. Thomas L. Floyd, “Digital fundamentals”, 978-0131946095, Publisher: Prentice-Hall 9th
Edition, Year 2006

Laboratory Requirement(s):
Computer with the following software:
1. MS Windows XP
2. Verilog HDL

Semester - Academic Year

The aim of the course is to introduce students to the design and operation of digital systems. The
students will be able to understand and design applications based on their knowledge about binary
operations and logic gates and truth tables.

Version 06/07-1 Page 1 of 5

Semester - Academic Year

Module Topics Week

1. Binary Systems 1–2

1.1. Digital Systems
1.2. Number convertion
1.3. Binary storage and registers
1.4. Binary logic
1.5. Binary arithmetic
1.6. Binary complements
1.7. Floating Point
1.8. Hex Addition
1.9. BCD Addition

2. Boolean Algebra and Logic Gates 3–5

2.1. Introduction to Boolean algebra
2.2. Theorems of Boolean algebra
2.3. Switching algebra
2.4. Boolean functions
2.5. Truth Tables
2.6. Maps and Symbols
2.7. Simplification and Minimization

3. Combinational Logic Applications 6–8

3.1. Adders
3.2. Subtractors
3.3. Decoders
3.4. Encoders
3.5. Multiplexers
3.6. Comparators

4. Sequential Logic 9 – 10
4.1. Timers
4.2. Latches
4.3. Flip-Flops
4.4. Analysis of clocked sequential circuits

5. Applications of Binary Operations 11 – 12

5.1. Bitwise Operation
5.2. Parity Checks
5.3. Checksum
5.4. Cyclic Redundancy check (CRC)
5.5. Hamming code

Version 06/07-3 Page 2 of 5

 6. Memory Cells 13 – 14
6.1. Random Access Memory
6.2. Read Only Memory
6.3. Programmable Logic Array
6.4. Programmable Array logic
6.5. Sequential Programmable Devices

Revision 15

Final Examination 16

Instructional Objectives1:
Upon successful completion of this course, the student will be able to:

1. Binary Systems
1.1. Describe digital systems
1.2. Explain Number conversation
1.3. Describe Binary storage and registers
1.4. Explain Binary logic
1.5. Explain Binary arithmetic
1.6. Describe Binary complements
1.7. Explain Floating Point
1.8. Explain Hex Addition
1.9. Explain BCD Addition

2. Boolean Algebra and Logic Gates

2.1. Describe Boolean algebra
2.2. Explain Theorems of Boolean algebra
2.3. Describe Switching algebra
2.4. Explain Boolean functions
2.5. Design Truth Tables
2.6. Draw Maps and use symbols
2.7. Describe Gate level Simplification and Minimization

3. Combinational Logic Applications

3.1. Explain Adders
3.2. Explain Subtracters
3.3. Explain Decoders
3.4. Explain Encoders
3.5. Explain Multiplexers
3.6. Explain Comparators

4. Sequential Logic
1∗ Conditions and standards for all enabling objectives are implied. They are "after completing this lesson" and "by correctly
answering the corresponding test item".

Version 06/07-3 Page 3 of 5

 4.1. Explain Timers
4.2. Explain Latches
4.3. Explain Flip-Flops
4.4. Analyze clocked sequential circuits

5. Applications of Binary Operations

5.1. Explain Bitwise Operation
5.2. Explain Parity Checks
5.3. Describe Checksum
5.4. Describe Cyclic Redundancy check (CRC)
5.5. Explain Hamming code

6. Memory Cells
6.1. Explain Random Access Memory
6.2. Explain Read Only Memory
6.3. Explain Programmable Logic Array
6.4. Explain Programmable Array logic
6.5. Explain Sequential Programmable Devices

List of Laboratory Exercises:

1. An exercise on binary numbers.

2. An exercise on binary arithmetic.
3. An exercise on truth table using AND/OR gates.
4. An exercise on Truth Table using NAND/NOR/XOR gates.
5. An exercise on using Karnaugh maps to minimize logic circuits.
6. An exercise on using adders and subtracters.
7. An exercise on using decoders and encoders.
8. An exercise on using multipliers and comparators.
9. An exercise on using RS-Latch Flip-flops.
10. An exercise on using D-Latch Flip-Flops.
11. An exercise on Bitwise operation and Hamming code.

Version 06/07-3 Page 4 of 5

Semester - Academic Year
Semester - Academic Year

Semester - Academic Year

• Homework 5%
• Quizes 5%
• Lab Work 10 %
• Mid Term Examination 30 %
• Final Exam 50 %

Semester - Academic Year

An overall grade will be assigned on the following grading scale.

INTERVAL 95 - 100 90 - 94 85 - 89 80 - 84 75 - 79 70 - 74 65 - 69 60 - 64 0 - 59
POINTS 4.00 3.75 3.50 3.00 2.50 2.00 1.50 1.00 0
LETTER
A+ A B+ B C+ C D+ D F
GRADE

Prepared by:
___________________
Mr. Gerald Y. Gonzales
Lecturer, CS Department
UCY

Approved by:
___________________
Dr. Fakeer Dawood
Head of Department
Computer Science

____________________

Date:

Version 06/07-3 Page 5 of 5