Home PageSyllabusMarcin Paprzycki
       

      CSC 204 DIGITAL COMPUTER ORGANIZATION


       


      Student Projects
      Robert Bankston
      Barbara Blakes
      Eric Blanks
      William Bond
      Conrad Curry
      Joseph Dixon
      George Donaldson
      Michael Kirgan
      Christopher McRae
      Latonya Moore
      John Sample
      Lenny Scardino
      Anthony Vesa
      James Wilkinson

      Material covered:

      Representation of information
      Computer representation of information -- Selection Criteria
      Assesment of compuetr performance
      How to write a paper reporting results of experimental work?
      Base conversions
      Binary arithmetic -- preliminaries -- addition and subtraction
      Hexadecimal and Octal notations as dinosaurs
      Other codes:

        BCD
        Gray Code
        Alphanumeric Codes
      Codes for error control:
        Parity check
        2-out-of-5
      Simplistic computer (SEC)
      SEC Instruction set -- initial subset
      Simple programs for SEC
      Levels of digital system analysis
        Functional
        Register transfer (LA highway system view)
        Logical (gates and flip-flops)
        Electronics
      Introduction to binary functions
      Switching functions, combinatorial networks and switching algebras
      Boolean expressions -- normal and canonical forms
      Minterms as tools to build AND-to-OR networks
      Other bollean connectives: NAND, NOR, XOR
      Analysis and synthesis of combinatorial networks
      Time as design factor -- introduction to minimization techniques
      Minimization based on KARNAUGH MAPS
        Karnaugh Map Representations
        Product terms on Karnaugh Maps
        Minimization of SOP expressions
        Minimization in case of DO NOT CARE expressions


      material up to this point will be covered on the MIDTERM EXAM!!!

      Combinational modules

        Encoder
        Decoder
                Transcoder
                Multiplexer
                Demultiplexer
      Sequential networks
               Time as factor in network analysis
               Feddback and memory (Latch)
               Asynchronous networks
      Flip-flops
               Introduction of clocking pulses
               Types of flip-flops
               Parallel registers
      Analysis and design of sequential synchronous networks
               Sequential network vs. Sequential machine
      Binary arithmetic unit
               Two's complement notation
               Operations on two's complement represented numbers
               Design of parallel adder
               Carry-look-ahead parallel adder

      Reading assignment - pages 1-92, 99-122, 130-143, 173-183, 184-195

      HOMEWORK

      1. Set up the WWW page for the project and e-mail the URL for the project.
      Due by: MIDNIGHT, Sunday, September 6th.

      2. Find on the Web TWO different computer benchmarks. Apply them to THREE different computers. Write a paper reporting the results of the experiments.
      Due by: IN CLASS, Thursday, September 10th.

      3. Page 20, problems: 1.1 -- 1.9, ODD PROBLEMS ONLY
      Due by: IN CLASS, Thursday, September 17th.

      4. WWW site update (to represent your effort and increased focus of the project).
      Due by: MIDNIGHT, Sunday, September 19th.

      5. Pages 41-42, problems: 2.1, 2.3, 2.5.
      Due by: IN CLASS, Thursday, September 24th.

      6. Pages 69-71, problems: 3.1, 3.3, 3.9, 3.15(a)
      Due by: IN CLASS, Thursday, October 8th.

      7. WWW site update (to represent your further effort and increased focus of the project). REMEBER! EACH update is to be a major update.
      Due by: MIDNIGHT, FRIDAY, October 9th.

      8. In class project presentation. Research summary. 5 minutes. Overheads.
      In class. October 13th.

      9. Pages 114-115, problems: 4.5, 4.7(a, b), 4.12(a)
      Due by: IN CLASS, Thursday, October 29th.

      10. WWW site update (to represent your further effort and increased focus of the project). REMEBER! EACH update is to be a major update.
      Due by: MIDNIGHT, Thursday, November 5th.