Software comes from heaven when you have good hardware. Ken Olsen

Slides:



Advertisements
Similar presentations
Princess Sumaya Univ. Computer Engineering Dept. Chapter 2: IT Students.
Advertisements

CECS 341 – Computer Design Primer.1(c) R. W. Allison.
Midterm Wednesday Chapter 1-3: Number /character representation and conversion Number arithmetic Combinational logic elements and design (DeMorgan’s Law)
LAB 9 Simulator Chap 14 REED. Datapath Simulator accompanying the text is a datapath simulator a.k.a. the Knob & Switch Computer developed by Grant Braught.
Introduction to Computers and Programming. Some definitions Algorithm: Algorithm: A procedure for solving a problem A procedure for solving a problem.
Assembly Language Lecture 0: Introduction. Outline What is Assembly Language? Why learn Assembly Language? Grade Text Book.
CS1104 – Computer Organization PART 2: Computer Architecture Lecture 1 Introduction.
[CS-251: Introduction to Computer organization and assembly Programming ] Course Guide Salma Idris Prince Sultan University, College for Women.
1 CS/COE0447 Computer Organization & Assembly Language Pre-Chapter 2.
Winter 2015 COMP 2130 Introduction to Computer Systems Computing Science Thompson Rivers University Introduction and Overview.
9/15/09 - L1 Crs OvrvwCopyright Joanne DeGroat, ECE, OSU1 Course Overview First Material.
COMP3221 lec04--prog-model.1 Saeid Nooshabadi COMP 3221 Microprocessors and Embedded Systems Lecture 4: Programmer’s Model of Microprocessors
The Central Processing Unit (CPU) and the Machine Cycle.
Computer Engineering Rabie A. Ramadan Lecture 1. 2 Welcome Back.
Data Manipulation CSC 2001 TTU CSC 2001 TTU. Now what?  Program can be represented (and stored) like data. So, now what happens?  The program needs.
Introduction to Programming Instructor: Yong Tang Brookhaven National Laboratory Working on accelerator control (BNL Phone #)
“It was the night before midterm”. Midterm rule (March 16 nd, 2005) - Student ID is required. Open books, note exam - Don’t: - Leave the exam room after.
 Lecture 2 Processor Organization  Control needs to have the  Ability to fetch instructions from memory  Logic and means to control instruction sequencing.
Represents different voltage levels High: 5 Volts Low: 0 Volts At this raw level a digital computer is instructed to carry out instructions.
An Example Architecture. A Paper Computer - Woody Woody's characteristics Word size – 8 bits One word.
CSE 3322 Computer Architecture Dr. John Patterson 614 NH Office Hours: M, W 11 –12 noon Grading Policy: Project 25%
Number Representation Lecture Topics How are numeric data items actually stored in computer memory? How much space (memory locations) is.
CDA 3100 Fall2009. Special Thanks Thanks to Dr. Xiuwen Liu for letting me use his class slides and other materials as a base for this course.
Review of the numeration systems The hardware/software representation of the computer and the coverage of that representation by this course. What is the.
Spring 2016, Jan 13 ELEC / Lecture 1 1 ELEC / Computer Architecture and Design Spring 2016 Introduction Vishwani D. Agrawal.
Page 1 Computer Architecture and Organization 55:035 Midterm Exam Review Spring 2011.
RISC / CISC Architecture by Derek Ng. Overview CISC Architecture RISC Architecture  Pipelining RISC vs CISC.
Course Information CSE 2031 Fall Instructor U.T. Nguyen Office: CSE Home page:
1 TM 1 Embedded Systems Lab./Honam University ARM Microprocessor Programming Model.
Computer Operation. Binary Codes CPU operates in binary codes Representation of values in binary codes Instructions to CPU in binary codes Addresses in.
First Foray into Programming (the hard way). A reminder from last lesson: A machine code instruction has two parts:  Op-code  Operand An instruction.
Programming with Java. Chapter 1 Focuses on: –components of a computer –how those components interact –how computers store and manipulate information.
Computer Organization Exam Review CS345 David Monismith.
Component 1.6.
ENCM 369 Computer Organization
CSCI 161: Introduction to Programming Course Introduction
CPU Organisation & Operation
CSE 3322 Computer Architecture
课程名 编译原理 Compiling Techniques
A Closer Look at Instruction Set Architectures
CDA 3100 Summer 2011.
Data Representation – Instructions
The fetch-execute cycle
Course Information and Introductions
Software comes from heaven when you have good hardware. Ken Olsen
CS149D Elements of Computer Science
EECE 310 Software Engineering
CSCI206 - Computer Organization & Programming
T Computer Architecture, Autumn 2005
CSCE Fall 2013 Prof. Jennifer L. Welch.
EE 445S Real-Time Digital Signal Processing Lab Spring 2014
CDA 3100 Summer 2013.
Winter 2018 CISC101 11/29/2018 CISC101 Reminders
CSCE 121: Simple Computer Model Spring 2015
CDA 3100 Spring 2010.
A primer on Computers and Programs
CS/COE0447 Computer Organization & Assembly Language
MARIE: An Introduction to a Simple Computer
MARIE: An Introduction to a Simple Computer
CSCE Fall 2012 Prof. Jennifer L. Welch.
Introduction to Microprocessor Programming
Welcome to: CSC225 Introduction to Computer Organization
CISC101 Reminders Labs start this week. Meet your TA! Get help with:
Computer Architecture
Program Execution.
October 29 Review for 2nd Exam Ask Questions! 4/26/2019
Professor: Shereen Khoja
Hmmm Assembly Language
Instruction execution and ALU
Week1 Architecture - Lecture outline & Assignments
Presentation transcript:

Software comes from heaven when you have good hardware. Ken Olsen Cosc 2P12 Week 1 Software comes from heaven when you have good hardware. Ken Olsen

2P12 Overview Course Website Course Outline Text Book is Digital Course Requirements Rules No talking Don’t be afraid to ask questions Respect the class Turn off cell phones

How to Pass 2P12 Come to lectures. Purchase the text book. Free marks for the taking Read the text and complete the exercises. Go to labs. These have a tutorial component which will make life easy and act as a primer for the assignments. Commit 10 hrs per week to the course.

How to Fail 2P12 Don’t come to class. The instructor posts the PowerPoint slides so the lectures are useless. Don’t go to labs. Attendance is not taken, so why bother going? Don’t read the text book. This stuff is boring. Blow off assignments, because they are not worth much. Or, start assignments the night before they are due. Or, plagiarize assignments. Party hard all term. Then try to cram ten week’s material into the day before the final exam.

Zybooks Online text book. Consists primarily of two parts: Participation Activities (Learning) It is recommended these be completed prior to the lecture. Challenge Activities (Testing) It is recommended these be completed after the lecture. 10% of your final grade will be based on these activities.

Participation Activities

Challenge Activities

Abstract View of a Computer

Compiler & Computer as Black Box

Assembly& Machine Language Abstraction

Generalized Computer Archetecture

General Registers in a Computer

Program Counter

Fetch Decode Execute Cycle Data is acted upon based on the instruction. Figure out what the instruction is, configure the cpu accordingly. Start Here, Get instruction from memory

Cycle of Steps Fetch Instruction Update Program Counter (Partial Decode) Decode Instruction (Full Decode) Load Operand(s) May result in memory references May use Regiters within the CPU Execute Operation Store Result

Instruction Set Architecture The assembly level instructions which can be successfully decoded and executed. Once decoded the execution engine will be either CISC RISC

RISC vs CISC

Base 10 numbers

Hex, Binary & Decimal

Base 16 Numbers

Base 8 Numbers

Base Conversion using Division

Binary to Decimal

Difficulties in Number Representation finite size (number of bits) in a computer e.g. 8 bit computer, +127 to -127 This is a magnitude problem infinite number of integers infinite # of rationals between any two integers infinite # of irrationals between any two rational # e.g. Pi = 3.141592654 This is a precision problem infinite # of rationals between any two irrationals

Representing Fractions Moving right from the radix point, each digit has decreasing weight of an additional factor of the base. 0.543210 represents 5x10-1 + 4x10-2 + 3x10-3 + 2x10-4 0.100112 represents 1x2-1 + 0x2-2 + 0x2-3 + 1x2-4 + 1x2-5

Fraction Transformation Precision

End