CS100: Introduction to Computer Science

Similar documents
CS100: Introduction to Computer Science

CS100: Introduction to Computer Science

Chapter 10 Computer Design Basics

Conversion Instructions:

.04. This means $1000 is multiplied by 1.02 five times, once for each of the remaining sixmonth

Unicenter TCPaccess FTP Server

CS100: Introduction to Computer Science

Domain 1 - Describe Cisco VoIP Implementations

Your organization has a Class B IP address of Before you implement subnetting, the Network ID and Host ID are divided as follows:

Multiplexers and Demultiplexers

How To Solve The Homewor Problem Beautifully

ODBC. Getting Started With Sage Timberline Office ODBC

Running Time ( 3.1) Analysis of Algorithms. Experimental Studies ( 3.1.1) Limitations of Experiments. Pseudocode ( 3.1.2) Theoretical Analysis

Lecture 13. Lecturer: Jonathan Kelner Scribe: Jonathan Pines (2009)

Serial ATA PCI Host Adapter AEC-6290/6295

SECTION 1.5 : SUMMATION NOTATION + WORK WITH SEQUENCES

*The most important feature of MRP as compared with ordinary inventory control analysis is its time phasing feature.

Domain 1: Configuring Domain Name System (DNS) for Active Directory

CPU Organization and Assembly Language

In order to print in ESC/P mode, the serial connection should be activated.

Domain 1: Designing a SQL Server Instance and a Database Solution

Mathematical goals. Starting points. Materials required. Time needed

BaanERP. BaanERP Windows Client Installation Guide

Desktop Management. Desktop Management Tools

CREATIVE MARKETING PROJECT 2016

Let s put together a Manual Processor

TruStore: The storage. system that grows with you. Machine Tools / Power Tools Laser Technology / Electronics Medical Technology

Quantitative Computer Architecture

7.1 Finding Rational Solutions of Polynomial Equations

Engineering Data Management

iprox sensors iprox inductive sensors iprox programming tools ProxView programming software iprox the world s most versatile proximity sensor

BaanERP 5.0c. EDI User Guide

L5352 Ethernet Communications Interface

PUBLIC RELATIONS PROJECT 2016

Overview on S-Box Design Principles

Baan Service Master Data Management

Listing terms of a finite sequence List all of the terms of each finite sequence. a) a n n 2 for 1 n 5 1 b) a n for 1 n 4 n 2

! encor e networks TM

THE ARITHMETIC OF INTEGERS. - multiplication, exponentiation, division, addition, and subtraction

PowerView. Model AP9215. User s Manual

Handling. Collection Calls

June 3, Voice over IP

Confidence Intervals for One Mean

A Secure Implementation of Java Inner Classes

Department of Computer Science, University of Otago

Encyclopedia of Healthcare Information Systems

MICROPROCESSOR. Exclusive for IACE Students iacehyd.blogspot.in Ph: /422 Page 1

6.0 LEVEL 3 BINNED PRODUCT

Shared Memory with Caching

Multiple Representations for Pattern Exploration with the Graphing Calculator and Manipulatives

Alternative Form of Dempster s Rule for Binary Variables

Example 2 Find the square root of 0. The only square root of 0 is 0 (since 0 is not positive or negative, so those choices don t exist here).

Elementary Theory of Russian Roulette

Lecture 16: Address decoding

Security Functions and Purposes of Network Devices and Technologies (SY0-301) Firewalls. Audiobooks

Research Method (I) --Knowledge on Sampling (Simple Random Sampling)

APPENDIX V TWO-YEAR COLLEGE SURVEY

Ethernet Option Board

5 Interconnection Networks

Central Processing Unit (CPU)

Domain 1 Components of the Cisco Unified Communications Architecture

MATH 083 Final Exam Review

Determining the sample size

In nite Sequences. Dr. Philippe B. Laval Kennesaw State University. October 9, 2008

E-Plex Enterprise Access Control System

CHAPTER 7: The CPU and Memory

Analyzing Longitudinal Data from Complex Surveys Using SUDAAN

Chapter 2 Logic Gates and Introduction to Computer Architecture

MICROPROCESSOR AND MICROCOMPUTER BASICS

Soving Recurrence Relations

Definition. A variable X that takes on values X 1, X 2, X 3,...X k with respective frequencies f 1, f 2, f 3,...f k has mean

Prof. Dr. Liggesmeyer, 2. Fault Tree Analysis (DIN 25424, IEC 61025) Reliability Block Diagrams (IEC 61078)

Neolane Leads. Neolane v6.1

Escola Federal de Engenharia de Itajubá

Modified Line Search Method for Global Optimization

hp calculators HP 12C Statistics - average and standard deviation Average and standard deviation concepts HP12C average and standard deviation

An Efficient Implementation of Automatic Cloud Cover Assessment (ACCA) on a Reconfigurable Computer

Vladimir N. Burkov, Dmitri A. Novikov MODELS AND METHODS OF MULTIPROJECTS MANAGEMENT

NBX Business Telephone Guide

Trigonometric Form of a Complex Number. The Complex Plane. axis. ( 2, 1) or 2 i FIGURE The absolute value of the complex number z a bi is

Configuring Additional Active Directory Server Roles

Cache and Bandwidth Aware Matrix Multiplication on the GPU

How to set up your GMC Online account

Now here is the important step

Review: Classification Outline

Message Exchange in the Utility Market Using SAP for Utilities. Point of View by Marc Metz and Maarten Vriesema

STUDENTS PARTICIPATION IN ONLINE LEARNING IN BUSINESS COURSES AT UNIVERSITAS TERBUKA, INDONESIA. Maya Maria, Universitas Terbuka, Indonesia

Technology Solutions for Reading, Writing & Organization. Sheila Simmons, Assistive Technology for Kansans

Week 3 Conditional probabilities, Bayes formula, WEEK 3 page 1 Expected value of a random variable

A Guide to Better Postal Services Procurement. A GUIDE TO better POSTAL SERVICES PROCUREMENT

Solving equations. Pre-test. Warm-up

International Journal on Emerging Technologies 1(2): 48-56(2010) ISSN :

2014 Menu of Agency Support Services 17 TOP OF MIND TOUCH POINTS

CS101 Lecture 26: Low Level Programming. John Magee 30 July 2013 Some material copyright Jones and Bartlett. Overview/Questions

Chair for Network Architectures and Services Institute of Informatics TU München Prof. Carle. Network Security. Chapter 2 Basics

ADMINISTRATION GUIDE Spring 2016

QUADRO tech. FSA Migrator 2.6. File Server Migrations - Made Easy

UM USER SATISFACTION SURVEY Final Report. September 2, Prepared by. ers e-research & Solutions (Macau)

Project Deliverables. CS 361, Lecture 28. Outline. Project Deliverables. Administrative. Project Comments

summary of cover CONTRACT WORKS INSURANCE

Transcription:

HW1: (Page 71: 2, 3) CS100: Itroductio to Computer Sciece 2. For each of the followig circuits, idetify the iput combiatios that produce a output of 1. Lecture 6: Data Maipulatio -- computer architecture, machie laguage & program executio 3. I each circuit below, the rectagles represet the same type of gate. Based o the iput ad output iformatio give, idetify whether the gate ivolved is a AND, OR, or XOR. HW1: (Page 72: 5) Address Cotets After step1 After step2 After step3 00 AB 02 02 02 01 53 53 53 53 02 D6 D6 01 01 03 02 02 02 53 Step 1: Move the cotets of the cell whose address is 03 to the cell at address 00. Step 2: Move the value 01 ito the cell at address 02. Step 3: Move the value stored at address 01 ito the cell at address 03. Review: Data compressio q Lossless Ru-legth ecodig Frequecy-depedet ecodig Dictioary ecodig q Lossy GIF JPEG TIFF MPEG MP3 Commuicatio errors q Parity bits (eve versus odd) q Checkbytes q Error correctig codes Chapter 2: Data Maipulatio 2.1 Computer Architecture 2.2 Machie Laguage 2.3 Program Executio Figure 2.1 CPU ad mai memory coected via a bus 1

Computer Architecture Stored Program Cocept Cetral Processig Uit (CPU) or processor q Arithmetic/Logic uit versus Cotrol uit Perform operatios o data Coordiate the machie s activities q Registers : for temporary storage of ifo. Geeral purpose Special purpose Bus q Wires coect CPU to mai memory Motherboard q Mai circuit board A program ca be ecoded as bit patters ad stored i mai memory. From there, the CPU ca the extract the istructios ad execute them. I tur, the program to be executed ca be altered easily. Termiology Machie Laguage Philosophies Machie istructio: A istructio (or commad) ecoded as a bit patter recogizable by the CPU Machie laguage: The set of all istructios recogized by a machie Reduced Istructio Set Computig (RISC) q Few, simple, efficiet, ad fast istructios q Example: PowerPC from Apple/IBM/Motorola Complex Istructio Set Computig (CISC) q May, coveiet, ad powerful istructios Easy to program A simple istructio i a CISC desig may require a multi-istructio sequece i a RISC desig. q Example: Petium from Itel Machie Istructio Types Data Trasfer: copy data from oe locatio to aother q LOAD: fill geeral-purpose register with the cotets of a memory cell q STORE: trasfer the cotets of a register to a memory cell Figure 2.2 Addig values stored i memory Arithmetic/Logic: use existig bit patters to compute a ew bit patters q Basic arithmetic operatios: ADDITION, DIVISION q Boolea operatios: AND, OR, XOR q Other operatios: SHIFT, ROTATE Cotrol: direct the executio of the program q Direct the executio of the program q JUMP: 2

Figure 2.3 Dividig values stored i memory Figure 2.4 The architecture of the machie described i Appedix C (16 geeralpurpose registers ad 256 memory cells) Parts of a Machie Istructio Op-code: Specifies which operatio to execute Operad: Gives more detailed iformatio about the operatio q Iterpretatio of operad varies depedig o opcode Figure 2.5 The compositio of a istructio for the machie i Appedix C (2 bytes for each istructio) Figure 2.6 Decodig the istructio 35A7 Figure 2.7 A ecoded versio of the istructios i Figure 2.2 3

Questios: Questios: 1. The followig are istructios writte i the machie laguage described i Appedix C. Rewrite them i Eglish q 368A q BADE 2. Traslate some istructios i Eglish ito machie laguage of Appedix C. q Load register umber 3 with the hexadecimal value 56 q Move the cotets of register F to register 4. 1. The followig are istructios writte i the machie laguage described i Appedix C. Rewrite them i Eglish q 368A: STORE the cotets of register 6 i memory cell umber 8A q BADE: JUMP to locatio DE if the cotets of register A equals to that of the register 0. 2. Traslate some istructios i Eglish ito machie laguage of Appedix C. q LOAD register umber 3 with the hexadecimal value 56: 2356 q MOVE the cotets of register F to register 4: 40F4 Program Executio Figure 2.8 The machie cycle Cotrolled by two special-purpose registers q Program couter: address of ext istructio q Istructio register: curret istructio Machie Cycle q q q Fetch Decode Execute Figure 2.9 Decodig the istructio B258 Figure 2.10 The program from Figure 2.7 stored i mai memory ready for executio 4

Figure 2.11 Performig the fetch step of the machie cycle Figure 2.11 Performig the fetch step of the machie cycle (cot d) Questios: Questios: 1. Suppose the memory cells from address 00 to 05 i the machie described i Appedix C cotai the (hexadecimal) bit patters give i the followig table: Address Cotets 00 14 Istructios: Istructios: 01 02 1402 1402(LOAD) 02 34 03 17 3417 3417(STORE) 04 C0 05 00 C000 C000(HALT) If we start the machie with is program couter cotaiig 00, what bit patter is i the memory cell whose address is hexadecimal 17 whe the machie halts. 1. Suppose the memory cells from address 00 to 05 i the machie described i Appedix C cotai the (hexadecimal) bit patters give i the followig table: Address Cotets 00 14 Istructios: Istructios: 01 02 1402 1402(LOAD) 02 34 03 17 3417 3417(STORE) 04 C0 05 00 C000 C000(HALT) If we start the machie with is program couter cotaiig 00, what bit patter is i the memory cell whose address is hexadecimal 17 whe the machie halts. (34) Questios: Questios: 2. Suppose the memory cells from address B0 to i the machie C cotai the (hexadecimal) bit patters give i the described i Appedix followig table: B0 B2 B4 B6 13 A3 33 C0 Address B1 B3 B5 B7 Cotets 02 00 0F Istructios: 13 A302 33 C000 Istructios: 13(LOAD) A302(ROTATE) 33(STORE) C000(HALT) a. If the program couter starts at B0, what bit patter is i register umber 3 after the first istructio has bee executed? b. What bit patter is i memory cell whe the halt istructio is executed. 2. Suppose the memory cells from address B0 to i the machie C cotai the (hexadecimal) bit patters give i the described i Appedix followig table: B0 B2 B4 B6 13 A3 33 C0 Address B1 B3 B5 B7 Cotets 02 00 0F Istructios: 13 A302 33 C000 Istructios: 13(LOAD) A302(ROTATE) 33(STORE) C000(HALT) a. If the program couter starts at B0, what bit patter is i register umber 3 after the first istructio has bee executed? (0F) b. What bit patter is i memory cell whe the halt istructio is executed. (C3) 5

Next Lecture: Istructios, commuicatig & other Architectures Readig assigmets: Chapter 2.4, 2.5,2.6 The 3 rd homework assigmet will be aouced 6