Basic

Data

Structure
 What is Data Type?

• Data types encompasses a particular kind of

data item, as defined by:
– the values it can take
– the operations that can be performed on it
 Data types

Basic data types Compound data types

Enumerated
integer boolean Class Type
float/double Array Pointer
character Unions
Data structures
Stack Table List
Tree
Queue File Graph
 Basic vs. Compound
Data Types and Structures

Basic data types CANNOT

be divided into simpler
parts Compound data
structures are BUILT
from data of basic types

Data structures are implemented

based on Abstract Data Types
(ADT)
 Variations of Integer in C++
Type Bit width Range
int 4 bytes -2147483648 to
2147483647
unsigned int 4 bytes 0 to 4294967295
short int 2 bytes -32768 to 32767
unsigned short 2 bytes 0 to 65,535
int
long int 4 bytes -2,147,483,648
to 2,147,483,647
unsigned long int 4 bytes 0 to
4,294,967,295
 Variations of Integer in Java
Type Bit width Range
byte 1 byte -128 to 127
short 2 bytes -32,768 to 32,767
int 4 bytes -2,147,483,648 to 2,147,483,
647
long 8 bytes -9,223,372,036,854,775,808 to
9,223,372,036,854,775,807
 Variations of Integer in Matlab
Type Bit width Range
int8 2 bytes -128 to 127
uint8 2 bytes -32,768 to 32,767
int16 4 bytes -2,147,483,648 to 2,147,483,
647
uint16 4 bytes -9,223,372,036,854,775,808 to
9,223,372,036,854,775,807
 Unsigned Integer
 
 Signed Integer

•  
 Negative numbers in binary
• Converting from decimal to binary
– Apply Two’s complement:
1. Write number in binary
2. Invert the digits
3. Add 1

Example Convert from decimal to binary [8 bits]:

-100
100 is 011001002 so -100 is 100110112 + 1 = 100111002
-127
127 is 011111112 so -127 is 100000002 + 1 = 100000012
 Floating point Numbers
• Number is stored in three parts:
• Sign bit
• Exponent bits
• Fraction (mantissa) bits

Sign bit Exponent bits Fraction bits

 Bits for Floating point numbers
Single precision number with 32 bits
32: 1-8-23

Double precision number with 64 bits

64: 1-11-52
 Floating point conversion (IEEE 754)

1. Conversion to binary number

• Integral
• fractional
2. Normalization of binary number
• The exponent is subtracted by the bias value
• Bias is 27-1 for single and 210-1 for double
• by shifting the decimal point until we get a 1 at the
left side of decimal point
 Conversion from decimal to binary
Example 1.
Determine the IEEE-754 Single Precision Floating-Point
Numbers of decimal value 8.75

Step 1 - Conversion to binary number

• Integral (8)
810 = 10002
Binary representation of
• fractional (0.75) 8.75 is 1000.11
0.75 x 2 = 1.5 -> 1
0.5 x 2 = 1.0 -> 1
 Conversion from decimal to binary
Example 1.
Determine the IEEE-754 Single Precision Floating-Point
Numbers of decimal value 8.75

Step 2 - Normalization of Binary Number

• Binary representation of 8.7510 is 1000.112
• Normalize 1000.112 by shifting the decimal point such
that we get a single digit 1 before decimal point.
1000.112 = 1.000112 x 23

That is, by shifting 3 decimal places to the left.

 Conversion from decimal to binary
Example 1.
Determine the IEEE-754 Single Precision Floating-Point
Numbers of decimal value 8.75

Obtain this format:

1000.112 = 1.000112 x 23
= (-1)0 x (1 + 0.000112) x 23
S=0
F = 00011
E-bias = 3
E-127 = 3
E=13010 =100000102
IEEE-754 Single Precision Floating-Point Numbers of decimal value 8.75 is
0 10000010 00011000000000000000000
 Conversion from binary to decimal
Example 2. Determine the decimal value of
0 10000000 110000000000000000000002
based on IEEE-754
Based on this format:

0 10000000 110000000000000000000002
S E F

= (-1)0 x (1 + 0.11002) x 210000000(base2)-127(base10)

= 1 x (1.11002) x 2128(base10)-127(base10)
= (1.11002) x 21
• integral, 112 = 3
= 11.100 2 • fractional, 0.100 =0.5
2
 Character
• character code used to represent :
– letters of the alphabet and digits
– printable symbols e.g. + *, &
– unprintable characters - Backspace, Form Feed, Carriage
Return, etc.
• Types of codes :
– EBCDIC (Extended Binary Coded Decimal Interchange Code)
based on 8 bits used by IBM
– ASCII (American Standard Code for Information Interchange)
based on 7 bits used by others
– Unicode characters include the basic ASCII character set and
later expanded to include other characters like Arabic,
Chinese, Japanese and other characters
The ASCII table
 Boolean type
• Value true or false which is stored as 1 or 0
• represents the value with logical and
relational operators
 Using
Using Boolean
Boolean variable
Variables
• Boolean variables is useful to program a
particular scenario, e.g. if a certain criteria is
achieved or some values were obtained
• Some examples:
–to denote if game is over
–if a certain rules has been compromised
–certain search value is matched
 Compound Data Types
• Arrays
• Classes / structures
• Enumerated Types
• Union
• Pointers
 Arrays
• A collection of data of same type –
Homogenous data type
• Linear compound data type with fixed size
• Subscript value – index
• Dimension of Arrays – 1, 2, 3, 4, .. N
 Operation on Arrays

• Access an item
• Insert a new item
• Delete an item
One dimensional Array in C++
Address of Array Elements
 Row Major and Column Major
Address Calculation
•In computing, row-major order and column-
major order are methods for storing
multidimensional arrays in linear storage such
as random access memory
•Different programming languages may use
different data layout when passing arrays
Row versus Column-wise based on
Programming Language
 Calculating address of array
element (Row-wise)
•  

 
 Calculating address of array
element (Column-wise)
•  

 
Two dimensional Array in C++
Three dimensional Array in C++
Two dimensional Array in SciLab
Two dimensional Array in MatLab
 Example

Question:
Using column-wise method, calculate the address of element
indexed as [5, 4, 7, 5] in an integer array of dimensions
6x7x8x9, where the base address, B = 173.
 Answer
Question:
Using column-wise method, calculate the address of element indexed as
[5, 4, 7, 5] in an integer array of dimensions 6x7x8x9, where the base
address, B = 173.
 Example

Question:
Using row-wise method, calculate the address of element
indexed as [5, 4, 7, 5] in an integer array of dimensions
6x7x8x9, where the base address, B = 173.
 Can you find the answer?

Question:
Using row-wise method, calculate the address of element
indexed as [5, 4, 7, 5] in an integer array of dimensions
6x7x8x9, where the base address, B = 173.
 The answer is…
Question: Using row-wise method, calculate the address of element indexed as [5, 4, 7, 5] in
an integer array of dimensions 6x7x8x9, where the base address, B = 173.
 Pointers
• Stores addresses of the next data
• Self referential structure
• Dynamic Memory allocation
– location not fixed
– memory location not contiguous

15 10 \
 Operation with Pointers
• Declare pointers
• Define variables of pointer
• Access values at address
• Insert a pointer
• Delete a pointer
 Class
• Implemented in Object-Oriented Programming
• Class describes attributes and methods of
objects that belong to it
• Attributes: variables (data)
• Methods: functions
• Objects: instance of a class
 Example of Class

● Menu is a Class
● menu1 and obj are objects of class Menu
Implementation of Menu class
 From Data Types
DataTypes to
TypesAbstract Data

• Data type
– a set of objects + a set of operations
– Example: integer
• set of whole numbers
• operations: +, -, x, /
• Can this be generalized?
– e.g. procedures generalize the notion of an operator
– Yes!
Abstract Data Types (ADT)
 Examples of ADT…

• Examples
– the set ADT
• A set of elements
• Operations: union, intersection, size and complement
– the queue ADT
• A set of sequences of elements
• Operations: create empty queue, insert, examine, delete, and
destroy queue
• Two ADT’s are different if they have the same underlying model but
different operations
– E.g. a different set ADT with only the union and find
operations
– The appropriateness of an implementation depends
very much on the operations to be performed
 Pros and Cons

✓ Implementation of the ADT is separate from its use

✓ Modular: one module for one ADT
– Easier to debug
– Easier for several people to work simultaneously
✓ Code for the ADT can be reused in different applications
✓ Information hiding
– A logical unit to do a specific job
– implementation details can be changed without affecting user programs
✓ Allow rapid prototyping
– Prototype with simple ADT implementations, then tune them later when
necessary
✓ Loss of efficiency
 Purpose of Data Structures

• managing complexity through abstraction

 Data Structures
• Lists
• Stacks
• Queues
• Trees
• Graphs
• Tables
Static vs Dynamic
Linear vs Non-linear
End of Slides