Karteikarten
1.4 - Data types, data structures and algorithms - Flashcards
Karten in diesem Stapel (27)
- 1BinaryA base-2 number system consiting of only 0's and 1's
- 2Problems with Sign + Magnitude- Max magnitude reduce (255 to 127)
- Binary contains 2 data types - Hard for arithmetic's - 3BCD(Binary Coded Decimal)
Eaach digit has its own 4 bits - 4Octal NumbersBase 8
- 5HexadecimalBase 16
(1,2,3,4,5,6,7,8,9,A,B,C,D,E,F) - 6ASCIIA system for stroring text as binary
Each character = 8 bits - 7EBCDICA system for stroing text as binary
Based on BCD - 8UnicodeA larger version of ASCII (Includes Chinese, Arabic...)
32 bits (growing) - 9MantissaHolds the digits of the number
- 10ExponentsDescirbes the position of the decimal place
- 11Why Normalise?- Each no. only has 1 combination
- Reduced waste in the mantissa, therefore increasing range and accuracy - 12Data 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 - 13Data 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 - 14Array DimensionsArrays can be set ip with multiple dimension
(2-D,3-D,4-D...) - 15Data Structures - RecordsA 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) - 16Data Stuctures - TuplesData 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) - 17Data Structures - QueuesA 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 - 18Circular QueuesWhen a queue utilises an array (static), they can be circular in nature
- 19Data Structures - StacksA 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) - 20FIFOFirst In First Out
- 21LIFOLast In First Out
- 22UnderflowWhen a program tries to remove data from an empty data structure
- 23Conjunction
- 24Disjunction
- 25Negation
- 26Exclusive Disjunction
- 27Equivalence
Informationen
- Beschreibung
- A2 - Level A2 Computer Science Karteikarten am 1.4 - Data types, data structures and algorithms - Flashcards, erstellt von Nathan Hall am 01/04/2016.
- Erstellt von
- Nathan Hall
- Aufrufe
- 34
- Bewertung