New User Special Price Expires in

Let's log you in.

Sign in with Facebook


Don't have a StudySoup account? Create one here!


Create a StudySoup account

Be part of our community, it's free to join!

Sign up with Facebook


Create your account
By creating an account you agree to StudySoup's terms and conditions and privacy policy

Already have a StudySoup account? Login here

CS 2011 Introduction of Computer System Lecture 2 (Week 3 notes)

by: Nemesi Notetaker

CS 2011 Introduction of Computer System Lecture 2 (Week 3 notes) CS2011

Marketplace > University of Cincinnati > Computer Science and Engineering > CS2011 > CS 2011 Introduction of Computer System Lecture 2 Week 3 notes
Nemesi Notetaker
GPA 3.0
View Full Document for 0 Karma

View Full Document


Unlock These Notes for FREE

Enter your email below and we will instantly email you these Notes for Introduction to Computer Systems

(Limited time offer)

Unlock Notes

Already have a StudySoup account? Login here

Unlock FREE Class Notes

Enter your email below to receive Introduction to Computer Systems notes

Everyone needs better class notes. Enter your email and we will send you notes for this class for free.

Unlock FREE notes

About this Document

These notes Key points of Lecture2, necessary for Midterm. By study from this document, you also will have a solid knowledge of Computer Organization and Design, Fifth Edition: The Hardware/Softwar...
Introduction to Computer Systems
Dr.Eric Hozier
Class Notes
Binary, addition, subtraction, decimal, hexadecimal, Boolean




Popular in Introduction to Computer Systems

Popular in Computer Science and Engineering

This 2 page Class Notes was uploaded by Nemesi Notetaker on Thursday January 28, 2016. The Class Notes belongs to CS2011 at University of Cincinnati taught by Dr.Eric Hozier in Spring 2016. Since its upload, it has received 35 views. For similar materials see Introduction to Computer Systems in Computer Science and Engineering at University of Cincinnati.

Popular in Computer Science and Engineering


Reviews for CS 2011 Introduction of Computer System Lecture 2 (Week 3 notes)


Report this Material


What is Karma?


Karma is the currency of StudySoup.

You can buy or earn more Karma at anytime and redeem it for class notes, study guides, flashcards, and more!

Date Created: 01/28/16
Module2 How can we represent numbers in a computer? Numbers are kept in computer hardware as a series of high and  low electronic signals, By encoding the signal we obtain values are above or below some threshold of pulses,   we represents them  as 1 3.3V­2.8V (T), or a 0 (F) 0.5V­0V. Strings of 1’s and 0’s can be interpreted as a  number. all information are composed of binary digits or bits  Also called binary bit. computer use on and off   signals, so a decimal digit was simply represented by several binary digits. Decimal proved so inefficient. Conversion Formula • Given an n­bit number  x  x 2 n1 x 2n2  x 2  x 2 0 n1 n2 1 0  Ex:  0000 0000 0000 0000 0000 0000 0000 1011 2 = 0 + … + 1×2  + 0×2  +1×2  +1×2 0 = 0 + … + 8 + 0 + 2 + 1 = 110  Placing these binary numbers side by side forms the instruction. Representing Instructions in the Computer  you can see from counting the number of bits, this MIPS instruction  takes exactly 32 bits—the same size as a data word. it from assembly language, we call the numeric version of  instructions machine language and a sequence of such instructions machine code. Since almost all computer  data sizes are multiples of 4, hexadecimal (base 16) numbers are popular. Since base 16 is a power of 2, we  can trivially convert by replacing each group of four binary digits by a single hexadecimal digit, and vice versa Conversion Formula 0 0000 4 0100 8 1000 c 1100 1 0001 5 0101 9 1001 d 1101 2 0010 6 0110 A 1010 e 1110 3 0011 7 0111 B 1011 f 1111  Example: eca8 6420 will result in:  1110 1100 1010 1000 0110 0100 0010 0000 ( where every 4 bits is per hex digit) Limits of every digit languages = Every language analyzed has limits so if the value will be outrangeof those in will result in the max value possible (ex. Dec 259 will be 255) Hex:00 16o FF 16 Dec: 010to 25510 Bin:00000000  2o 11111111 2 Numbers  ver this value will not be rappresentabile In computer science, Languages are connected to Alan Turing's work on algorithms, computability and to  compiler design thanks to a set of rules called Chomsky’s Hierarchy. Chomsky’s Hierarchy= It is a containment hierarchy of classes of formal grammars (a set of production  rules for strings in a formal language) The Chomsky hierarchy consists of the following levels, each of is a  subset of the classes above it, :  *wiky Date representation= Instruction are plugged as a  Most current machines use 32 bits (4 bytes) words and the Limits addresses to 4GB Byte Ordering= depending on the processor Text representation of binary machine code are readed in a  different way. Endianess, describes the order of byte transmission over a digital link.  Big Endian: Sun, PPC Mac, Internet Least significant byte has highest address Little Endian: x86 Least significant byte has lowest address EX Variable x has 4­byte representation 0x01234567 01 23 45 67 Example Fragment • Deciphering Numbers • Value: 0x12ab  • Pad to 32 bits: 0x000012ab  • Split into bytes: 00 00 12 ab  • Reverse: ab 12 00 00


Buy Material

Are you sure you want to buy this material for

0 Karma

Buy Material

BOOM! Enjoy Your Free Notes!

We've added these Notes to your profile, click here to view them now.


You're already Subscribed!

Looks like you've already subscribed to StudySoup, you won't need to purchase another subscription to get this material. To access this material simply click 'View Full Document'

Why people love StudySoup

Bentley McCaw University of Florida

"I was shooting for a perfect 4.0 GPA this semester. Having StudySoup as a study aid was critical to helping me achieve my goal...and I nailed it!"

Kyle Maynard Purdue

"When you're taking detailed notes and trying to help everyone else out in the class, it really helps you learn and understand the I made $280 on my first study guide!"

Jim McGreen Ohio University

"Knowing I can count on the Elite Notetaker in my class allows me to focus on what the professor is saying instead of just scribbling notes the whole time and falling behind."

Parker Thompson 500 Startups

"It's a great way for students to improve their educational experience and it seemed like a product that everybody wants, so all the people participating are winning."

Become an Elite Notetaker and start selling your notes online!

Refund Policy


All subscriptions to StudySoup are paid in full at the time of subscribing. To change your credit card information or to cancel your subscription, go to "Edit Settings". All credit card information will be available there. If you should decide to cancel your subscription, it will continue to be valid until the next payment period, as all payments for the current period were made in advance. For special circumstances, please email


StudySoup has more than 1 million course-specific study resources to help students study smarter. If you’re having trouble finding what you’re looking for, our customer support team can help you find what you need! Feel free to contact them here:

Recurring Subscriptions: If you have canceled your recurring subscription on the day of renewal and have not downloaded any documents, you may request a refund by submitting an email to

Satisfaction Guarantee: If you’re not satisfied with your subscription, you can contact us for further help. Contact must be made within 3 business days of your subscription purchase and your refund request will be subject for review.

Please Note: Refunds can never be provided more than 30 days after the initial purchase date regardless of your activity on the site.