Dr. Thomas R. Turner
University of Central Oklahoma
College of Mathematics and Science
Computer Science
MCS 134
Contact Information
406.974.5853
trturner@uco.edu
// CS 2833 Computer Organization I

Course Administration

Assignments

Projects

Project Submission Instructions

Reports

Lectures

  • L000: Course Administration
  • L000: Course Administration youtube
  • L001: 1.1 Overview
  • L002: 1.2 The Main Components of a Computer
  • L003: 1.3 An Example System: Wading through the Jargon
  • L004: 1.4 Standards Organizations
  • L005: 1.5 Historical Development
  • L006: 1.6 The Computer Level Heirarchy
  • L007: 1.7 Cloud Computing: Computing as a Service
  • L008: 1.8 The Von Neumann Model
  • L009: 1.9 Non-Von Neumann Models
  • L010: 1.10 Parallel Processors and Parallel Computing
  • L011: 1.11 Parallelism: Enabler or Machine Intelligence - Deep Blue and Watson
  • L012: 2.1 Data Representation in Computer Systems
  • L013: 2.2 Positional Numbering Systems
  • L014: 2.3 Converting Between Bases
  • L015: 2.4 Signed Integer Representation
  • L016: 2.5 Floating-Point Representation
  • L017: 2.6 Character Codes
  • L018: 2.7 Error Detection and Correction
  • L019: Project p01 Overview
  • L020: 3.1 Introduction
  • L021: 3.2 BOOLEAN ALGEBRA
  • L022: 3.2.1 Boolean Expression
  • L023: 3.2.2 Boolean Identities
  • L024: 3.2.3 Simplification of Boolean Expressions
  • L025: 3.2.4 Complements
  • L026: 3.2.5 Representing Boolean Functions
  • L027: 3.3 LOGIC GATES
  • L028: 3.3.1 Symbols for Logic Gates
  • L029: 3.3.2 Universal Gates
  • L030: 3.3.3 Multiple Input Gates
  • L031: 3.4 KARNAUGH MAPS
  • L032: 3.4.2 Description of KMaps and Terminology
  • L033: 3.4.3 KMap Simplification for Two Variables
  • L034: 3.4.4 KMap Simplification for Three Variables
  • L035: 3.4.5 KMap Simplification for Four Variables
  • L036: 3.4.6 Don't Care Conditions
  • L037: 3.4.7 Summary
  • L038: 3.5 DIGITAL COMPONENTS
  • L039: 3.5.1 Digital Circuits and Their Relationship to Boolean Algebra
  • L040: 3.5.2 Integrated Circuits
  • L041: 3.5.3.Putting It All Together: From Problem Descriptions to Circuit
  • L042: 3.6 COMBINATIONAL CIRCUITS
  • L043: 3.6.1 Basic Concepts
  • L044: 3.6.2 Examples of Typical Combinational Circuits
  • L045: 3.6.2.1 Half-Adder
  • L046: 3.6.2.2 Full-Adder
  • L047: 3.6.2.3 Ripple Carry Adder
  • L048: 3.6.2.4 Decoder
  • L049: 3.6.2.5 Multiplexer
  • L050: 3.6.2.6 Parity Checker
  • L051: 3.6.2.7 4-Bit Shifter
  • L052: 3.6.2.8 2-Bit ALU
  • L053: 3.6.2.8 2-Bit Multiplier
  • L054: 3.7 SEQUENTIAL CIRCUITS
  • L055: 3.7.1 Basic Concepts
  • L056: 3.7.2 Clocks
  • L057: 3.7.3 Flip-Flops
  • L058: 3.7.3.1 SR Flip-Flop
  • L059: 3.7.3.2 JK Flip-Flop
  • L060: 3.7.3.3 D Flip-Flop
  • L061: 3.7.3.4 Flip-Flop Design
  • L062: 3.7.3.5 Flip-Flop Conversion
  • L063: 3.7.4 Finite State Machines
  • L064: 3.7.4.1 Synchronous Sequential Circuit Design
  • L065: 3.7.4.2 Step 1. The State Diagram
  • L066: 3.7.4.3 Step 2. The Present-State-Next-State Table
  • L067: 3.7.4.4 Step 3. The Next-State Decoder
  • L068: 3.7.4.5 Step 4. The Logic Diagram
  • L069: 3.7.5 Examples of Sequential Circuits
  • L070: 3.7.5.1 2-Bit Synchronous Counter
  • L071: 3.7.5.2 3-Bit Synchronous Counter
  • L072: 3.7.5.3 4-Bit Synchronous Counter
  • L073: 3.7.5.4 4-Bit Register
  • L074: 3.7.5.5 4 X 3 Memory
  • L075: 3.7.5.6 Analysis of Synchronous Sequential Circuits
  • L076: 3.7.5.7 Step 1. Equations for the Next-State Decoder
  • L077: 3.7.5.8 Step 2. K-Maps for the Next-State Decoder
  • L078: 3.7.5.9 Step 3. The Present-State-Next-State Table
  • L078: 3.7.5.9 Step 3. The Present-State-Next-State Table youtube
  • L079: 3.7.5.10 Step 4. The State Diagram
  • L079: 3.7.5.10 Step 4. The State Diagram youtube
  • L080: 3.7.5.11 Example Mixed-Type Flip-Flop
  • L080: 3.7.5.11 Example Mixed-Type Flip-Flop youtube
  • L081: 3.7.5.12 Example 4-State Counter
  • L082: 3.7.5.13 Example 8-State Counter
  • L083: 3.7.5.14 Example Serial Subtractor
  • L084: 3.8 DESIGNING CIRCUITS
  • L085: 4.1 MARIE: An Introduction to a Simple Computer
  • L086: 4.2 CPU Basics and Organization
  • L087: 4.3 The Bus
  • L088: 4.4 Clocks
  • L089: 4.5 The Input/Output Subsystems
  • L090: 4.6 Memory Organization and Addressing
  • L091: 4.7 Interrupts
  • L092: 4.8 MARIE
  • L093: 4.9 Instruction Processing
  • L094: 4.10 A Simple Program
  • L095: 4.11 A Discussion on Assemblers
  • L096: 4.12 Extending our Instruction Set
  • L097: Project p02 Overview
  • L098: 4.13 Decoding: Hardwired versus Microprogrammed Control
  • L099: 4.14 Real-World Examples of Computer Architecture

MARIE Simulator Marie Simulator: Right-click and download to your computer

Tests