Data ordering and Addressing Standards - Big Endian and Small Endian

KaushikGhosh92 59 views 8 slides May 08, 2019
Slide 1
Slide 1 of 8
Slide 1
1
Slide 2
2
Slide 3
3
Slide 4
4
Slide 5
5
Slide 6
6
Slide 7
7
Slide 8
8

About This Presentation

The presentation shared describes the various methods of data ordering and addressing standards, along with an animation describing how elements are stored in an array in various. standards


Slide Content

Data Ordering and Addressing Standards A Presentation By Kaushik Ghosh CSE –B Roll number- 13000116101

Why data ordering? Where’s my notebook?

Data Addressing in Computers Memory in a computer is in form of an array The index of any array is an element’s address. Each data is made up of elements.

Elements- Byte addressable system An element can be of any size 8 bits= 1Byte When the element size is 1byte, Addressing system is called Byte-Addressable Memory. Other examples are nibble-addressable memory(4 bits)

Ordering standards Example Data 12 CD 34 AB hex 16 numbers representation in hexadecimal System 4 bits needed for each digit 12 CD 34 AB hex = 32 bits Hence, In byte-addressable memory 32/8 = 4 bytes= 4 elements

Data Ordering AB 34 CD 12 AB 34 CD 12 Big Endian Least significant Byte in maximum address AB 34 CD 12 AB 34 CD 12 Little Endian Least significant Byte in smallest address

I think I can find my notebook now. A presentation by Kaushik Ghosh CSE section B : Roll 13000116101

References Messy photo- http://www.dawsons.co.uk/blog/wp-content/uploads/2013/01/messy-office-03.jpg array pic - https://docs.oracle.com/javase/tutorial/figures/java/objects-tenElementArray.gif Organised files pic- https://www.thestorageguy-madison.com/media/1306/files.jpg Man Icon- MS Office 2016 icons library