Please enable JavaScript.

Coggle requires JavaScript to display documents.

Data Types - Coggle Diagram

- - - - Info
        
        True may be 1 or -1 or any other non-zero value
        
        False is 0
        
        Single bit can be used
        
        Can have either true or false
      - About
        
        Logical data type
        
        Represents true and false
        
        History
        
        Introduced in Algol 60
        
        Simplest data type
    - - Most commonly used
        
        8-bit ascii
        
        Iso 8859-1
        
        Unicode
      - Each character assigned to different number
        
        Stored as numeric codes
      - Single character as value
    - - Integers
        
        Storage representation
        
        Unsigned
        
        Signed
        
        Two's complement
        
        Sign magnitude
        
        One's complement
        
        Operations on integer data
        
        Arithmetic
        
        Binary
        
        Unary
        
        Relation
        
        Assignment
        
        Bit operation
      - Floating point
        
        Types
        
        Float
        
        Standard size usually 4 bytes
        
        Double
        
        2x space of float
        
        IEEE floating point standard 754
        
        Issues
        
        Loss of accuracy
        
        Larger range
        
        Representation
        
        Computer
        
        Exponent & mantissa
        
        Complex
        
        Descriptors
        
        Used for type checking and building code
        
        Used by run-time system if dynamic
        
        Collection of attributes of variables
  - - - constants implicitly start from 0,1 but can be reassigned
      - ordered list of distinct values
        
        could be assigned any value
      - rarely intended
      - no type checking
        
        Advantages
        
        No arithmetic operations
        
        Enhanced Readability
  - - - Data elements have pre defined type
        
        element is identified by its position
    - - Static Array
        
        statically bound and static allocation
        
        Size known at compile time
      - Fixed Stack- Dynamic Array
        
        Space Efficient
        
        Size known at compile time
      - Fixed Heap Dynamic
        
        Binding done during request
        
        Allocated from heap which is longer than stack
        
        Heap Dynamic Array
        
        Binding is dynamic in heap
        
        Dimensions
      - One-dimensional arrays - Vector
        
        value can be computed if statically bound
        
        can be accessed by using the function
      - Two-dimensional arrays - Matrix
        
        row major order
        
        address is base address of structure
      - Multi-dimensional arrays
        
        Associative Array
        
        only design issue that is specific for associative arrays is the form of references to their elements.
        
        Rectangular and Jagged Arrays
        
        Rectangular array
        
        all rows have same number and all columns too
        
        Jagged Array
        
        Lengths no need to be same
  - - - About
        
        Describe Text patterns
        
        Characters have own syntax
        
        aka
        
        regexp
        
        regex
        
        matching text done by Regex Engine
      - Basic Elements
        
        Position indicators
        
        Character sets
        
        Quantifiers
      - Character sets
        
        Character classes
        
        [xy] - x or y
        
        [a-z] - a or b or ……z
        
        etc.
      - Quantifiers
        
        Specify repetition
        
        generally applies to preceded item
    - - String length
        
        Limited dynamic length strings
        
        Linked list
        
        But simpler allocation and deallocation
        
        Extra storage
        
        Complex operations
        
        Adjacent storage cells
        
        Faster operations
        
        Less storage required
        
        But not practical with increasing string size
        
        Pointer array
        
        Faster than linked list
        
        Extra memory