5002183
Beschreibung
Karteikarten von Nathan Hall, aktualisiert more than 1 year ago
|
Erstellt von Nathan Hall
vor mehr als 8 Jahre
|
|
| Frage | Antworten |
| Binary | A base-2 number system consiting of only 0's and 1's |
| Problems with Sign + Magnitude | - Max magnitude reduce (255 to 127) - Binary contains 2 data types - Hard for arithmetic's |
| BCD | (Binary Coded Decimal) Eaach digit has its own 4 bits |
| Octal Numbers | Base 8 |
| Hexadecimal | Base 16 (1,2,3,4,5,6,7,8,9,A,B,C,D,E,F) |
| ASCII | A system for stroring text as binary Each character = 8 bits |
| EBCDIC | A system for stroing text as binary Based on BCD |
| Unicode | A larger version of ASCII (Includes Chinese, Arabic...) 32 bits (growing) |
| Mantissa | Holds the digits of the number |
| Exponents | Descirbes the position of the decimal place |
| Why Normalise? | - Each no. only has 1 combination - Reduced waste in the mantissa, therefore increasing range and accuracy |
| Data Structures - Arrays | - If data is related it is sensible to group them together - Arrays must be declared giving their size and data type (Determines the memory space allocaeted) - Statics - cannot change in size |
| Data Structures - Lists | - Dynamic - Can grow in size - Operates like an array but doesn't need to be appended - Creates a static array, but makes more if necessary - Array full? Create new array (x2 size), data is copied occross - More vesatile than arrays |
| Array Dimensions | Arrays can be set ip with multiple dimension (2-D,3-D,4-D...) |
| Data Structures - Records | A 2-D array that allows for the use of multiple data types Give it an identifier then state what fields the record is to contain (Database) |
| Data Stuctures - Tuples | Data in a list or an array can mutate (be altered), therefore is is known as a mutable data type A tuple is a data structure that cannot mutate (immutable)(works like a constant array) |
| Data Structures - Queues | A list that is limited to only allow cdata to be inserted from one end, and retrieved from the other FIFO Enqueue - Data is pushed into the queue from on end Dequeue - Data is popped out from the other end |
| Circular Queues | When a queue utilises an array (static), they can be circular in nature |
| Data Structures - Stacks | A list which is limited to only allow data to be inserted and retrieved from one end LIFO Can only access from the top Used to reverse the order of a list (recirsive function) |
| FIFO | First In First Out |
| LIFO | Last In First Out |
| Underflow | When a program tries to remove data from an empty data structure |
| Conjunction | |
| Disjunction | |
| Negation | |
| Exclusive Disjunction | |
| Equivalence |
Möchten Sie mit GoConqr kostenlos Ihre eigenen Karteikarten erstellen? Mehr erfahren.