Carnegie Mellon 1 Midterm Review 15-213: Introduction to Computer Systems October 14, 2013.

Slides:



Advertisements
Similar presentations
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.
Advertisements

Carnegie Mellon 1 Dynamic Memory Allocation: Basic Concepts : Introduction to Computer Systems 17 th Lecture, Oct. 21, 2010 Instructors: Randy Bryant.
1/1/ / faculty of Electrical Engineering eindhoven university of technology Introduction Part 2: Data types and addressing modes dr.ir. A.C. Verschueren.
1 Answers to Test 1, Question 1 The function determines if the number is divisible by 6. It performs this by dividing the number first by 3 and then by.
CSE 351 Midterm Review. Your midterm is next Wednesday Study past midterms (link on the website) Point of emphasis: Registers are not memory Registers.
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 Nested Procedures Procedures that don't call others are called leaf procedures, procedures that call others are called nested procedures. Problems may.
CSE 332: C++ exceptions Overview of C++ Exceptions Normal program control flow is halted –At the point where an exception is thrown The program call stack.
15213 Recitation Fall 2014 Section A, 8 th September Vinay Bhat.
University of Washington Today Topics: Floating Point Background: Fractional binary numbers IEEE floating point standard: Definition Example and properties.
Carnegie Mellon Floating Point : Introduction to Computer Systems – Recitation January 24, 2011.
Computer Architecture Wed: 14:00-14:00, 14/34 Instructor: Jihad El-Sana Office:111, Building:37 Tel:
Recitation # Section F Spring 2006 Jernej Barbic.
Overview C programming Environment C Global Variables C Local Variables Memory Map for a C Function C Activation Records Example Compilation.
Floating Point Numbers
Methods & Activation Record. Recap: what’s a method?
IEEE Floating Point Numbers Overview Noah Mendelsohn Tufts University Web: COMP.
CS 3843 Final Exam Review Fall 2013 December 5, 2013.
Carnegie Mellon Introduction to Computer Systems /18-243, spring 2009 Recitation, Jan. 14 th.
1 Carnegie Mellon Stacks : Introduction to Computer Systems Recitation 5: September 24, 2012 Joon-Sup Han Section F.
Erik Jonsson School of Engineering and Computer Science FEARLESS Engineeringwww.utdallas.edu/~pervin EE/CE 2310 – HON/002 Introduction to Digital Systems.
1 Carnegie Mellon Recitation : Introduction to Computer Systems Recitation 15: December 3, 2012 Daniel Sedra Section C.
Problem of the Day  Why are manhole covers round?
Carnegie Mellon 1 Representing Data : Introduction to Computer Systems Recitation 3: Monday, Sept. 9 th, 2013 Marjorie Carlson Section A.
Computer Architecture Lecture 26 Fasih ur Rehman.
1 Number Systems Lecture 10 Digital Design and Computer Architecture Harris & Harris Morgan Kaufmann / Elsevier, 2007.
Carnegie Mellon /18-213: Introduction to Computer Systems Instructors: Anthony Rowe, Seth Goldstein and Gregory Kesden 27 th (and last) Lecture,
CS161 Topic #16 1 Today in CS161 Lecture #16 Prepare for the Final Reviewing all Topics this term Variables If Statements Loops (do while, while, for)
1 COMS 161 Introduction to Computing Title: Numeric Processing Date: November 08, 2004 Lecture Number: 30.
Carnegie Mellon 1 Midterm Review : Introduction to Computer Systems Recitation 8: Monday, Oct. 19, 2015 Ben Spinelli.
ITEC 352 Lecture 19 Functions in Assembly. Functions + Assembly Review Questions? Project due on Friday Stacks Function activation / deactivation.
Data Representation : Introduction to Computer Systems Recitation 2: Monday, Jan. 29th, 2015 Dhruven Shah.
1 Carnegie Mellon Welcome to recitation! : Introduction to Computer Systems 3 rd Recitation, Sept. 10, 2012 Instructor: Adrian Trejo (atrejo) Section.
Chapter 6 Methods Chapter 6 - Methods.
Reminder Bomb lab is due tomorrow! Attack lab is released tomorrow!!
October 1, 2003Serguei A. Mokhov, 1 SOEN228, Winter 2003 Revision 1.2 Date: October 25, 2003.
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
University of Washington Floating-Point Numbers The Hardware/Software Interface CSE351 Winter 2013.
Carnegie Mellon Midterm Review : Introduction to Computer Systems October 15, 2012 Instructor:
Copyright 2006 by Timothy J. McGuire, Ph.D. 1 MIPS Programming Model CS 333 Sam Houston State University Dr. Tim McGuire.
1 Floating Point. 2 Topics Fractional Binary Numbers IEEE 754 Standard Rounding Mode FP Operations Floating Point in C Suggested Reading: 2.4.
Introduction to Computer Systems Topics: Assembly Stack discipline Structs/alignment Caching CS 213 S ’12 rec8.pdf “The Class That Gives CMU Its.
Section 5: Procedures & Stacks
Chapter 14 Functions.
Recitation 5: Attack Lab
Floating Point Borrowed from the Carnegie Mellon (Thanks, guys!)
CS 105 “Tour of the Black Holes of Computing!”
CSCI206 - Computer Organization & Programming
Introduction To Computer Systems
Recitation 4&5 and review 1 & 2 & 3
Topics IEEE Floating Point Standard Rounding Floating Point Operations
PRESENTED BY J.SARAVANAN. Introduction: Objective: To provide hardware support for floating point arithmetic. To understand how to represent floating.
What to bring: iCard, pens/pencils (They provide the scratch paper)
Lecture 10: Floating Point, Digital Design
CSCI206 - Computer Organization & Programming
Generating a software loop with memory accesses
Direct Mapping.
CS 105 “Tour of the Black Holes of Computing!”
10/4: Lecture Topics Overflow and underflow Logical operations
CS 3843 Midterm Two Review Fall 2013 Prof. Qi Tian.
Lecture 2 SCOPE – Local and Global variables
Machine-Level Programming III: Arithmetic Comp 21000: Introduction to Computer Organization & Systems March 2017 Systems book chapter 3* * Modified slides.
Machine-Level Programming III: Arithmetic Comp 21000: Introduction to Computer Organization & Systems March 2017 Systems book chapter 3* * Modified slides.
Return-to-libc Attacks
15-213: F19 Midterm Review Session
ECE 120 Midterm 1 HKN Review Session.
Implementing Functions: Overview
Presentation transcript:

Carnegie Mellon 1 Midterm Review : Introduction to Computer Systems October 14, 2013

Carnegie Mellon 2 Agenda Midterm Brief Overview of few Topics Practice Questions

Carnegie Mellon 3 Midterm Wed Oct 16 th to Sun Oct 20 th.  Check timings for each day on the websitewebsite  Duration - 80 minutes nominal time, but you can have upto 4 hrs to finish the exam. Cheat Sheet – ONE double sided 8 ½ x 11 paper  No worked out problems in that sheet. What to study?  Chapters 1-3 and Chapter 6  Note that in previous years, Chapter 6 (memory hierarchy) was covered by Exam 2 How to Study?  Read each chapter 3 times, work practice problems and do problems from previous exams.

Carnegie Mellon 4 Floating Point Sign, Exponent, Mantissa  (−1)××2 Bias (2 −1 − 1) Denormalized  exp = 000…000  E = 1 – bias  Small values close to zero. Special Values  exp = 111…111  +/-inf, NaN

Carnegie Mellon 5 Floating Point(contd) Normalized  exp != 0 and exp != all ones  E = exp – bias Rounding  Round-up – if the spilled bits are greater than half  Round-down – if the spilled bits are less than half  Round to even – if the spilled bits is exactly equal to half

Carnegie Mellon 6

7 ASSEMBLY REVIEW

Carnegie Mellon 8 Assembly Loop

Carnegie Mellon 9 Assembly Loop void mystery(int *array, int n) { int i; for(________; ________; _______) { if(___________ == 0) ___________; }

Carnegie Mellon 10 Assembly – Stack How arguments are passed to a function  IA-32  X86-64 Return value from a function How these instructions modify stack  call, leave, ret  pop, push

Carnegie Mellon 11 Given assembly code of foo() and bar(), Draw a detailed picture of the stack, starting with the caller invoking foo(3, 4, 5).

Carnegie Mellon 12

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

Carnegie Mellon 14 Find H,J

Carnegie Mellon 15 Caching Concepts Dimensions: S, E, B  S: Number of sets  E: Associativity – number of lines per set  B: Block size – number of bytes per block (1 block per line) Given Values for S,E,B,m  Find which address maps to which set  Is it a Hit/Miss. Is there an eviction  Hit rate/Miss rate

Carnegie Mellon 16 Questions/Advice Relax! Work Past exams! us -