1 / 45

Data Types

Data Types. simple and compound abstraction and implementation. A brief history. simple types arrays - compounds of same type strings records – compounds of different types pointers and references user defined types abstract data types objects. Simple types.

malise
Download Presentation

Data Types

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. Data Types simple and compound abstraction and implementation

  2. A brief history • simple types • arrays - compounds of same type • strings • records – compounds of different types • pointers and references • user defined types • abstract data types • objects

  3. Simple types integer floating pointbinary-coded decimal character boolean user-defined types • not composed of other types • hardware or software implemented usually in hardware usually in software

  4. Integer • 2’s complement • unsigned • operations exact within range • range depends on size of virtual cell - typical size: 1, 2, 4, 8 bytes

  5. Floating Point • based on scientific notation • representations and operations are approximate • range and precision depend on size of virtual cell (usually 4 or 8 bytes) 1 11 52 bits

  6. Binary Coded Decimal • ‘exact’ decimal arithmetic • decimal digits in 4 bit code • range and precision depend on size of virtual cell – 2 digits per byte defined decimal point 4 4 5 9 0 5 7 8 1 8

  7. Character • ASCII – 128 character set – 1 byte • Unicode – 2 byte extension • usually coded as unsigned integer

  8. Boolean • 1 bit is sufficient but... • no bit-wise addressability in hardware • store in a byte – space inefficient • store 8 per byte – execution inefficient • c: 0=false, non-zero=true

  9. User-defined types • implemented (like character and boolean usually are) as a coding of unsigned integer • enumerated type: (Pascal example) type suit = (club, diamond, heart, spade); var lead: suit; lead := heart; internally represented as { 0, 1, 2, 3 } operations:

  10. User-defined types • implemented as a restricted range of integer • subrange type: (Ada example) subtype CENTURY20 is INTEGER range 1900..1999; BIRTHYEAR: CENTURY20; BIRTHYEAR := 1981;

  11. User-defined types • Type compatibility issues: -can two enumerated types contain same constant? -can defined types be coerced with integer, with each other?

  12. Memory management intro • The parser creates a symbol table of identifiers including variables: • Some information, name plus more, is bound at this time and as the program is compiled by storage in symbol table: e.g. int x; --> x type: int addr: offset name type address

  13. Strings • First use: output formatting only • Quasi-primitive type in most languages (not just arrays of character) - operations: initialization, substring, catenation, comparison • The length problem: fixed or varying? • No standard string model

  14. Strings - examples JAVA String s = “abc”+x; s = s.substring(0,2); fixed length array extended syntax class with 70 methods c char *s = “abc”; int len = strlen(s); array of char with terminal: extended syntax library of methods a b c 0

  15. Strings - representations In symbol table • fixed length and content (static) • fixed length and varying content (FORTRAN) • varying length and content by reallocation (java String) • varying length and content by extension (java StringBuffer) • Varying length and content(c) Static str Length Address Dynamic str MaxLength CurrLength Address char* Address

  16. Compound (1) Arrays • collection of elements of one type • access to individual elements is computed at execution time by position, O(1), or O(dim)

  17. Arrays – design decisions • indexing: dimensions – limit? recursive? types – int, other, user defined? first index: 0, 1, variable range checking – no(c), yes(java) lexemes – ‘subscripts’ = (),[]?

  18. Arrays – design decisions • binding times type, index type index range(ie array size), space static fixed stack-dynamic stack-dynamic heap-dynamic initial values of elements at storage allocation? e.g. int[] x = {1,2,3};

  19. Arrays – operations • on elements – based on type • on entire array as variables - - vector and matrix operations e.g.,APL - sub array (~ substring) • subarray dimensions(slices)

  20. Arrays – storage <array> element type, size index type index lower bound index upper bound address address upper bound lower bound

  21. Arrays – element access address of a[i] = address + (i-lower bound)*size <array> element type, size index type index lower bound index upper bound address address i lower bound

  22. Arrays - multidimensional • contiguous or not • row major, column major order • computed location of element

  23. <array> <array> <array> <array> <array>, 4 <array>, 3 <array>, 5 <array>, 7 index type index type index type index type index lower bound index lower bound index lower bound index lower bound index upper bound index upper bound index upper bound index upper bound address address address address Jagged arrays • Implemented as arrays of arrays <array> <array>, 4 index type index lower bound index upper bound address address

  24. (2) Associative Arrays - maps • values accessed by keys,not indices • no order of elements • automatic growth of capacity • operations: add/set, get, remove • fast search for individual data • slower for batch processing than array • Java classes; Perl data structure

  25. Associative Arrays - implementation • hash tables based on key value • most operations ‘near O(1)’ • expanding capacity may be O(n) For a java class that combines features of array and associative array, see LinkedHashMap

  26. (3)Records • multiple elements of any type • elements accessed by field name • design issues: - hierarchical definition (records within records) - syntax of naming - scopes for elliptical (incomplete) reference to fields

  27. Records - implementation <array> a <record> element type, size dept index type index lower bound array [1..4] of char index upper bound address 0 (offset) code address integer upper bound lower bound 4 address type course = record dept : array[1..4] of char; code : integer; end address C O S C 3127 course dept

  28. (4) Pascal variant records (unions) type coord = (polar, cart); point = record case rep : coord of polar: ( radians : boolean; radius : real; angle : real); cart: ( x : real; y : real); end; • Note: • varying space requirements • discriminant field is optional (rep) • type checking loopholes: Ada has similar variant record but closed these loopholes

  29. Other unions Sebesta’s c example union flextype { int intE1; float floatE1; } union flexType ell; float x; ell.intE1 = 27; x = ell.floatE1; • Fortran EQUIVALENCE • c union • not inside records • no type checking * unions do not cause type coercion - data is reinterpreted

  30. (5)Sets (Pascal) • defined on one (discrete) base type • implementation imposes maximum size (set of integer;-not possible) type day = (M, Tu, W, Th, F, Sa, Su); dayset = set of day; var work, wknd : dayset; today : day; today = F; work = [M, Tu, W, Th, F]; wknd = [Sa, Su, F]; if (today in work and wknd) ... 1 1 1 1 1 0 0 0 0 0 0 1 1 1 0 0 0 0 1 0 0

  31. (6) Pointers and references • references are dereferenced pointers (whatever that means) • primary purpose: dynamic memory access • secondary purpose: indirect addressing as in machine instructions

  32. Pointers (and references) • data type that stores an address in the format of the machine (usually 4 bytes) or a “null” • a pointer must be dereferenced to get the data at the address it contains • a reference is a pointer data type that is automatically dereferenced

  33. Dereferencing example In Java: Point2D.Double p; p = new Point2D.Double(0.0,0.0); double xCoord = p.x; In c++: double x,y; Point p(0.0,0.0); Point *pref; pref = &p; x = p.X; y = (*pref).Y; Dereferencing and field access combined Dereferencing Field access

  34. Pointers hold addresses • Indirect addressing In c: pointer to statically allocated memory int a,b; int *iptr, *jptr; a = 100; iptr = &a; jptr = iptr; b = *jptr; int x, y, arr[4]; int *iptr; iptr = arr; arr[2] = 33; x = iptr[2]; y = *(iptr + 2); • Security loophole…

  35. Pointer arithmetic • Arithmetic operations on addresses int x; int *iptr; iptr = &x; for (;;){ << process loc (*iptr)>> iptr++; } Scan through memory starting at x

  36. Basic dynamic memory management model: • Heap manager keeps list of available memory cells • “Allocate” operation transfers cell from list in heap to program • “Deallocate” transfers cell from program back to list in heap • Tradeoffs of fixed or variable sized cells

  37. Problems with pointers and dynamic memory:1 • Dangling reference: pointer points to de-allocated memory Point *q; Point *p = new Point(0,0); q = p; delete p; // q is dangling - reference to q should cause // an error - ‘tombstones’ will do error check

  38. Problems with pointers and dynamic memory: 2 • Memory leakage: memory cell with no reference to it Point *p = new Point(0,0); p = new Point(3,4); // memory containing Point(0,0) object // is inaccessible - counting references will help

  39. Cause of reference problems • Multiple references to a memory cell • Deallocation of memory cells • Where is responsibility? -automatic deallocation (garbage collection) OR -user responsibility (explicit ‘delete’)

  40. int *p =*q = 6; p = null; p 6 q p 6 q User management of memory • Dangling references can be detected as errors but not prevented - tombstones - lock and key • Memory leakage is a continuing problem

  41. Garbage Collection 1. Reference counting:ongoing “eager” -memory cells returned to heap as soon as all references removed. 2. Garbage collection:occasional “lazy” -let unreferenced memory cells ‘leak’ till heap is nearly empty then collect them

  42. Reference counting: Reference count in cell int *p = *q = 6; 2 Classic problem: circular linked lists p = null; 1 q = null; 0 Count 0 -> return cell to heap

  43. f f t t t t Garbage Collection: (mark-sweep) 1. All cells in memory marked inaccessible(f) ‘Accessible’ marker in cell Classic problem: effect on program performance 2. Follow all references in program and mark cells accessible(t); 3. Return inaccessible cells to heap

  44. A sloppy java example • from Main (Data Structures) public class ObjectStack { private Object[] data; private int manyItems; .... public Object pop() { if (manyItems==0) throw new EmptyStackException(); return data[--manyItems]; //leaves reference in data } }

  45. Managing heap ofvariable-sized cells • Necessary for objects with different space requirements • Problem: tracking cell size • Problem: heap defragmentation - keep blocks list in size order? - keep blocks list in sequence order?

More Related