CTP118 - Computer Organization
2012 - 2013 Fall

Department of Computer Technology and Programming
(Last updated: 14/05/2009)   (CWPS ver: 2.0.2)
Instructor:
E-mail:
Lecture:
Grading:    
    Midterm 1: 25%
    Midterm 2: 25%
    Quiz 1: 5%
    Quiz 2: 5%
    Final: 40%

The aim of this course is to prepare the students for computing and technical programming. Number theory.Definitions, operations and properties of Boolean algebra. Digital logic gates. Combinational Systems.Flip, flops. Sequential Logic. Registers, shift registers, counters. ALU, CPU, Control Unit.
Credit: 3 credits.
Lecture Hours: 4 hours in a week.

Learning Objectives:
1. To understand the usage of different number systems.
2. To understand the use of switching circuits and Boolean algebra.
3. To simplify sum-of-products using Karnaugh maps.
4. To analize and design Combinational Circuits,
5. To analize Sequential circuits.
Textbooks and Other Materials:
  • Required: "Computer Engineering", M. M. Mano
  • Required: "Computer System Architecture", M. M. Mano
  • Required: "Discrete Mathematics", Richard Johnsonbaugh
  • Recommended: "Discrete Mathematics", Melvin Hausner
  • Recommended: "Discrete Mathematical Structures for Computer Science", Bernard Kolman, Robert C. Busby
  • Recommended: "A First Course in Discrete Mathematics", J.Molluzzo, F.Buckley
    Detailed Weekly Course Outline:
    Week Date COURSE OUTLINE
    1 13/09/2012
    17/09/2012
    Introduction : Objectives of the course, Binary Digits
    2 20/09/2012
    24/09/2012
    Number Systems: Binary digits , octal and hexadecimal conversions.
    3 27/09/2012
    01/10/2012
    Binary Digits : Arithmetic Operations, Complements
    4 04/10/2012
    08/10/2012
    Boolean Algebra : Basic Theorems and Properties, Boolean functions. Canonical and
    Standard forms
    QUIZ I
    5 11/10/2012
    15/10/2012
    Digital Logic Gates
    6 18/10/2012
    22/10/2012
    The Karnaugh map method, two and three variable maps, four, five and six
    varible maps.
    7 25/10/2012
    29/10/2012
    MIDTERM WEEK
    8 01/11/2012
    05/11/2012
    Product of sums simplification, don’t care conditions
    9 08/11/2012
    12/11/2012
    Combinational Systems – half adder, full adder
    10 15/11/2012
    19/11/2012
    Decoders, encoders, multiplexers
    QUIZ II
    11 22/11/2012
    26/11/2012
    Flip – flops
    12 29/11/2012
    03/12/2012
    Sequential Logic
    13 06/12/2012
    10/12/2012
    State tables and State diagrams Registers, Shift registers, counters
    14 13/12/2012
    17/12/2012
    Finite State machines. Automata and grammars.
    15 20/12/2012
    24/12/2012

    Useful Documents
  • Logic Design Lecture Notes  
    End of CTP118 main page.