Exam #1 Review By sseshadr. Agenda Reminders – Test tomorrow! One 8.5 x 11 sheet, two sides – Pick up your datalabs in OH – Cachelab comes out tomorrow.

Slides:



Advertisements
Similar presentations
1 of 32 Images from Africa. 2 of 32 My little Haitian friend Antoine (1985)
Advertisements

Zero exponent/Neg. exponent Absent Thurs/Fri 10/31-11/1
14-1 Bard, Gerstlauer, Valvano, Yerraballi EE 319K Introduction to Embedded Systems Lecture 14: Gaming Engines, Coding Style, Floating Point.
1 Lecture 3: MIPS Instruction Set Today’s topic:  More MIPS instructions  Procedure call/return Reminder: Assignment 1 is on the class web-page (due.
Review of the MIPS Instruction Set Architecture. RISC Instruction Set Basics All operations on data apply to data in registers and typically change the.
The University of Adelaide, School of Computer Science
University of Washington Procedures and Stacks II The Hardware/Software Interface CSE351 Winter 2013.
1/1/ / faculty of Electrical Engineering eindhoven university of technology Introduction Part 2: Data types and addressing modes dr.ir. A.C. Verschueren.
Machine/Assembler Language Putting It All Together Noah Mendelsohn Tufts University Web:
CSE 351 Midterm Review. Your midterm is next Wednesday Study past midterms (link on the website) Point of emphasis: Registers are not memory Registers.
The MIPS 32 1)Project 1 Discussion? 1)HW 2 Discussion? 2)We want to get some feel for programming in an assembly language - MIPS 32 We want to fully understand.
1 Procedure Calls, Linking & Launching Applications Lecture 15 Digital Design and Computer Architecture Harris & Harris Morgan Kaufmann / Elsevier, 2007.
10/9: Lecture Topics Starting a Program Exercise 3.2 from H+P Review of Assembly Language RISC vs. CISC.
1 Today’s lecture  Last lecture we started talking about control flow in MIPS (branches)  Finish up control-flow (branches) in MIPS —if/then —loops —case/switch.
Computer Architecture CSCE 350
1 Nested Procedures Procedures that don't call others are called leaf procedures, procedures that call others are called nested procedures. Problems may.
CS1104 – Computer Organization PART 2: Computer Architecture Lecture 4 Assembly Language Programming 2.
Princess Sumaya Univ. Computer Engineering Dept. Chapter 3:
Princess Sumaya Univ. Computer Engineering Dept. Chapter 3: IT Students.
RECITATION - 09/20/2010 BY SSESHADR Buflab. Agenda Reminders  Bomblab should be finished up  Exam 1 is on Tuesday 09/28/2010 Stack Discipline Buflab.
Carnegie Mellon Floating Point : Introduction to Computer Systems – Recitation January 24, 2011.
Recitation # Section F Spring 2006 Jernej Barbic.
Floating Point Numbers
1/8/ L24 IEEE Floating Point Basics Copyright Joanne DeGroat, ECE, OSU1 IEEE Floating Point The IEEE Floating Point Standard and execution.
CS 3843 Final Exam Review Fall 2013 December 5, 2013.
Fundamental of Computer Architecture By Panyayot Chaikan November 01, 2003.
Carnegie Mellon Introduction to Computer Systems /18-243, spring 2009 Recitation, Jan. 14 th.
1/8/ L24 IEEE Floating Point Basics Copyright Joanne DeGroat, ECE, OSU1 IEEE Floating Point The IEEE Floating Point Standard and execution.
1 Number Systems Lecture 10 Digital Design and Computer Architecture Harris & Harris Morgan Kaufmann / Elsevier, 2007.
Carnegie Mellon 1 Midterm Review : Introduction to Computer Systems October 14, 2013.
Lecture 4: MIPS Instruction Set
1/8/ L24 IEEE Floating Point Basics Copyright Joanne DeGroat, ECE, OSU1 IEEE Floating Point The IEEE Floating Point Standard and execution.
Integer and Fixed Point P & H: Chapter 3
Computer Architecture Lecture 22 Fasih ur Rehman.
Carnegie Mellon 1 Midterm Review : Introduction to Computer Systems Recitation 8: Monday, Oct. 19, 2015 Ben Spinelli.
1 Carnegie Mellon Welcome to recitation! : Introduction to Computer Systems 3 rd Recitation, Sept. 10, 2012 Instructor: Adrian Trejo (atrejo) Section.
CSE 351 x86 Calling Conventions, Control Flow, & Lab 2 April 23, 2015.
Carnegie Mellon 1 Midterm Review : Introduction to Computer Systems Recitation 8: Monday, Oct. 14, 2013 Marjorie Carlson Section A.
Carnegie Mellon 1 Midterm Review : Introduction to Computer Systems Recitation 8: Monday, Oct. 13, 2014 Lou Clark.
CS 3843 Computer Organization Prof. Qi Tian Fall 2013
EECS 370 Discussion 1 xkcd.com. EECS 370 Discussion Topics Today: – ARM Addressing Endianness, Loading, and Storing Data – Data Layout Struct Packing.
Number Representation Fixed and Floating Point
Carnegie Mellon Midterm Review : Introduction to Computer Systems October 15, 2012 Instructor:
Data Lab: Manipulating Bits
1 Binghamton University Exam 1 Review CS Binghamton University Birds eye view -- Topics Information Representation Bit-level manipulations Integer.
Introduction to Computer Systems Topics: Assembly Stack discipline Structs/alignment Caching CS 213 S ’12 rec8.pdf “The Class That Gives CMU Its.
Assembly function call convention
2.4. Floating Point Numbers
Floating Point Representations
CSCI206 - Computer Organization & Programming
Recitation 4&5 and review 1 & 2 & 3
More GDB, Intro to x86 Calling Conventions, Control Flow, & Lab 2
Floating Point Number system corresponding to the decimal notation
The Stack & Procedures CSE 351 Spring 2017
S09 Recitation #1 Jernej Barbic (S06) Revised: Alex Gartrell (S09)
What to bring: iCard, pens/pencils (They provide the scratch paper)
Roadmap C: Java: Assembly language: OS: Machine code: Computer system:
CSCI206 - Computer Organization & Programming
The IEEE Floating Point Standard and execution units for it
CSCI206 - Computer Organization & Programming
CSE 351 Section 10 The END…Almost 3/7/12
The University of Adelaide, School of Computer Science
Computer Instructions
Recitation 5 – 2/19/01 Outline
Machine-Level Representation of Programs (x86-64)
The IEEE Floating Point Standard and execution units for it
Review In last lecture, done with unsigned and signed number representation. Introduced how to represent real numbers in float format.
Computer Organization and Assembly Language
15-213: F19 Midterm Review Session
ECE 120 Midterm 1 HKN Review Session.
Presentation transcript:

Exam #1 Review By sseshadr

Agenda Reminders – Test tomorrow! One 8.5 x 11 sheet, two sides – Pick up your datalabs in OH – Cachelab comes out tomorrow Review Questions

[Subset of] What to Know Labs! – We try to reward people who did them well Assembly – Basics (what does cmp do, source vs. dest, operand order for add, etc.)? – What registers are special? Caller save vs. callee save? – Switch statements and jump tables? – Loops? – You should be able to trace through assembly. Practice it. – You should be able to write small amounts of assembly (like buflab). Data Representation – Two’s compliment – Floating point – Endianness

[Subset of] What to Know Stack – What’s different in 32- vs. 64-bit – You should know parameters, ebp values, return address, etc. Larger Structures – Structs and Unions What’s the difference? Padding and alignment – Arrays Multi-dimensional access Control – Loops in assembly? – Recursion? Memory – Heap vs. Stack – What is the L1 Cache?

Floating Point Review Basics – Sign, Mantissa, Exponent – Round to even – Bias – Infinity, +- zero, NaN – Normalized vs. Denormalized

/4 56 Infinity / /128

Round-to-even examples Represent 25/64 with 4 exponent bits, 3 fraction bits. Bias is 2 (4-1) – 1 = 7 – :Rounded DOWN to value 3/8 Represent 27/64 with 4 exponent bits, 3 fraction bits – :Rounded UP to value 7/16 Represent 51/128 with 4 exponent bits, 3 fraction bits – :Rounded UP to value 13/32 – Didn’t use round-to-even on this… it wasn’t a “tie”

Array Access Start with the C code Then look at the assembly – Work backwards! Easiest to just do an example

*(array2 + yH + x) Remember though, multiply the offset by sizeof(int) *(array1 + xJ + y) rdx must have value Hy +x rax must have value Jx +y rax == x rdx == 3y rax == 32x rax == 31x rdx == 6y+x rax == 31x + y

Structs What is a union again? How big are things? – If you can’t remember, cheat sheet. – int, char, pointer (you should know these by now) – float, double, short Alignment rules – If you can’t remember, cheat sheet.

aaaabbxxcccccccc dxxxeeeef xxxgggg hhhh Are we done??? NO!! xxxx