1.4 data types, structures and algorithms(unfin) Flashcards
(24 cards)
1
Q
primitive data types
A
integer
real/floating point
character
string
Boolean
2
Q
abstract data types
A
3
Q
composite data types
A
4
Q
static vs dynamic
A
5
Q
binary
A
types:
-positive integers
-sign and magnitude
-floating points
operations:
-addition, subtraction
-shifting: AND, OR, XOR
6
Q
ASCII
A
7
Q
Unicode
A
8
Q
arrays
A
9
Q
records
A
10
Q
lists
A
11
Q
tuples
A
12
Q
linked list
A
13
Q
graphs
A
-directed
-undirected
14
Q
stack
A
15
Q
tree
A
16
Q
binary search tree
A
17
Q
hash table
A
stored as array, with a key map to a unique index
collision: when two keys produce the same hash value, the item will be placed in the next available space
use: commonly use for indexing, as it allows quick access
18
Q
K-map
A
19
Q
Boolean expressions with logical operators
A
20
Q
rules to simplify boolean expressions
A
21
Q
logic gates
A
22
Q
d-type flip flops
A
22
Q
half adder
A
23
Q
full adder
A
