CS 3843 Final Exam Review Fall 2013 December 5, 2013.

Slides:



Advertisements
Similar presentations
Computer Organization and Architecture Tutorial 6 Kenneth Lee.
Advertisements

Princess Sumaya Univ. Computer Engineering Dept. Chapter 3:
Princess Sumaya Univ. Computer Engineering Dept. Chapter 3: IT Students.
Chapter 2 Representing and Manipulating Information Prof. Qi Tian CS 3843 Fall
Logic Circuits Another look at Floating Point Numbers Common Combinational Logic Circuits Timing Sequential Circuits Note: Multiplication & Division in.
Computer ArchitectureFall 2007 © September 10, CS-447– Computer Architecture M,W 2:30-3:50pm Lecture 8.
Major Numeric Data Types Unsigned Integers Signed Integer Alphanumeric Data – ASCII & UNICODE Floating Point Numbers.
Assembly Language and Computer Architecture Using C++ and Java
Major Numeric Data Types Unsigned Integers Signed Integers Alphanumeric Data – ASCII & UNICODE Floating Point Numbers.
CS250: Computer Architecture Midterm Review Prof. Chris Clifton February 28, 2007.
CSE 378 Floating-point1 How to represent real numbers In decimal scientific notation –sign –fraction –base (i.e., 10) to some power Most of the time, usual.
Prof. Hakim Weatherspoon CS 3410, Spring 2015 Computer Science Cornell University See: P&H Chapter 2.4, 3.2, B.2, B.5, B.6.
1/8/ L24 IEEE Floating Point Basics Copyright Joanne DeGroat, ECE, OSU1 IEEE Floating Point The IEEE Floating Point Standard and execution.
Chapter 12 Digital Logic Circuit Copyright © The McGraw-Hill Companies, Inc. Permission required for reproduction or display.
Topic 4 Computer Mathematics and Logic
Introduction to Computing Systems from bits & gates to C & beyond Chapter 2 Bits, Data Types & Operations Integer Representation Floating-point Representation.
Computer Organization and Architecture Computer Arithmetic Chapter 9.
Computer Architecture Lecture 3: Logical circuits, computer arithmetics Piotr Bilski.
Number Systems So far we have studied the following integer number systems in computer Unsigned numbers Sign/magnitude numbers Two’s complement numbers.
CPS3340 COMPUTER ARCHITECTURE Fall Semester, /14/2013 Lecture 16: Floating Point Instructor: Ashraf Yaseen DEPARTMENT OF MATH & COMPUTER SCIENCE.
9/15/09 - L27 CountersCopyright Joanne DeGroat, ECE, OSU1 Final Exam Review Exam Time: MONDAY o dark 30 7:30AM this room.
07/19/2005 Arithmetic / Logic Unit – ALU Design Presentation F CSE : Introduction to Computer Architecture Slides by Gojko Babić.
Instructor: Alexander Stoytchev CprE 281: Digital Logic.
1 Number Systems Lecture 10 Digital Design and Computer Architecture Harris & Harris Morgan Kaufmann / Elsevier, 2007.
DIGITAL CIRCUITS David Kauchak CS52 – Fall 2015.
Carnegie Mellon 1 Midterm Review : Introduction to Computer Systems October 14, 2013.
Princess Sumaya Univ. Computer Engineering Dept. Chapter 3:
التحليل والتصميم المنطقي DIGITAL DESIGN Instructor : Khalil Alsulbi Mobile : Room : 217.
Carnegie Mellon 1 Midterm Review : Introduction to Computer Systems Recitation 8: Monday, Oct. 19, 2015 Ben Spinelli.
Monday, January 14 Homework #1 is posted on the website Homework #1 is posted on the website Due before class, Jan. 16 Due before class, Jan. 16.
CPS3340 Computer Architecture Fall Semester, 2013
1 ELEN 033 Lecture 4 Chapter 4 of Text (COD2E) Chapters 3 and 4 of Goodman and Miller book.
Data Representation : Introduction to Computer Systems Recitation 2: Monday, Jan. 29th, 2015 Dhruven Shah.
1. Computing Systems Lecture 3 Binary Representation & Boolean Logic Binary and Logic 2.
Logic Design CS221 1 st Term combinational circuits Cairo University Faculty of Computers and Information.
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.
Lecture 2 Number Representation, Overflow and Logic Topics Adders Math Behind Excess-3 Overflow Unsigned, signed-magnitude Two’s Complement Gray Code Boolean.
CS 3843 Computer Organization Prof. Qi Tian Fall 2013
1 Ethics of Computing MONT 113G, Spring 2012 Session 4 Binary Addition.
ELECTRICAL ENGINEERING: PRINCIPLES AND APPLICATIONS, Third Edition, by Allan R. Hambley, ©2005 Pearson Education, Inc. Chapter 7 Logic Circuits.
MicroProcessors Lec. 4 Dr. Tamer Samy Gaafar. Course Web Page —
1 Floating Point. 2 Topics Fractional Binary Numbers IEEE 754 Standard Rounding Mode FP Operations Floating Point in C Suggested Reading: 2.4.
COMPUTER ARCHITECTURE & OPERATIONS I Instructor: Yaohang Li.
Computing Systems Lecture 3 Binary Representation & Boolean Logic Binary and Logic 1.
CHAPTER 13 Digital Logic Circuits. Figure Voltage analog of internal combustion engine in-cylinder pressure Figure 13.1.
1 Digital Logic Design (41-135) Chapter 5 Number Representation & Arithmetic Circuits Younglok Kim Dept. of Electrical Engineering Sogang University Spring.
Lecture 6. Fixed and Floating Point Numbers
DIGITAL LOGIC CIRCUITS
Recitation 4&5 and review 1 & 2 & 3
CPEG323 Quiz 1 Review Long Chen October, 26th, 2005.
Topics IEEE Floating Point Standard Rounding Floating Point Operations
Computer Architecture Syllabus
University of Gujrat Department of Computer Science
TAO1221 COMPUTER ARCHITECTURE AND ORGANIZATION LAB 6
What to bring: iCard, pens/pencils (They provide the scratch paper)
Lecture 10: Floating Point, Digital Design
CSCI206 - Computer Organization & Programming
How to represent real numbers
13 Digital Logic Circuits.
CS 3843 Midterm Two Review Fall 2013 Prof. Qi Tian.
Recitation 5 – 2/19/01 Outline
Instructor: Alexander Stoytchev
LOGIC Circuits.
The IEEE Floating Point Standard and execution units for it
Overview Fractions & Sign Extension Floating Point Representations
Chapter 2 Representing and Manipulating Information
Fundamentals of Digital Logic and Number Systems
Prof. Qi Tian Fall 2013 CS 3843 Midterm Review Prof. Qi Tian Fall 2013.
ECE 120 Midterm 1 HKN Review Session.
Presentation transcript:

CS 3843 Final Exam Review Fall 2013 December 5, 2013

Topics What to cover? – Lectures for Chapter 2, Chapter 3 and Chapter – Lectures on truth table, Karnaugh Map – Class notes for Chapters 2-4 What are allowed? – Scientific calculator – Two sheets of note (both sides, standard 11’×8.5’ letter size) – The Y86 encoding diagram will be provided. What is not allowed? – Talking to each other – Other notes and book materials

Final Exam Scores Assignments: 20% – Assignment 0 and Assignment 1-6 Quizzes and recitation participation: 10% – Quiz: drop 1 lowest grade out of 5 (5%) – Recitation participation: 5% Midterms: 35% – Two midterms (17.5% each) Final Exam: 35%

Any Questions about your grading TA: K. M. Sabidur Rahman Office: FLN (f.SB)

Tips Study – Assignments 1-6 and their solutions – Quizzes 1-5 – Practice Problems – Lecture Slides – Practice problems Solutions are available under –

Chapter 2 Conversion between different numbering systems – Based R representation and its conversion to decimal – Conversion between decimal, binary, and hexadecimal – Integer and Fraction part Binary representation of n-bit word for signed and unsigned integers – 2’s, 1’s complement and sign/magnitude Boolean operators and logical operators – &, |, ^, ~ – &&, ||, ! Shift operators ( > A, >> L ) Number representations using different data types (int, short, char, long) n-bit IEEE floating-point representation – S, M, E, bias, exp (k bits), frac (n bits) – Single precision and double precision – Normalized, denormalized, special values (+/- inf, NAN) – Largest, smallest value Rounding – Round-to-even; Round-towards-zero; Round-down, Round-up

Chapter 3 Trace the register values in given assembly procedure Understand all the IA32 assembly instructions, different operands and memory addressing modes; Understand Assembly Codes and Write Correct Comments

Chapter 3 (continued …) Understand Conditional Codes (ZF, SF, OF, and CF) Write C codes from the given assembly codes and vice versa; Identify and correct any mistakes in given assembly instructions

Chapter 4 Y86 instruction encodings Translate object code to assembly code Translate Y86 instructions to object code Truth table and basic block diagram of logic gates (AND, OR, NOT, XOR, NAND, NOR), MUX, ALU, 1-bit full adder Function complete set Truth Table and two-, three-, four-varibales Karnaugh- Map – minterm, maxterm, don’t-care term – Minimum sum-of-product solution