WorksheetsData Types, Structures an Algebra Mega Quiz
Total questions: 72
Worksheet time: 1hrs 1mins
Name
Class
Date
1.
Using 8-bit sign and magnitude, represent the denary value of 59 in binary
a)
111011
b)
110010
c)
111100
d)
011000
2.
Using 8-bit sign and magnitude, represent the denary value of -2 in binary
a)
01001010
b)
10000010
c)
00001001
d)
00010010
3.
Using 8-bit sign and magnitude, represent the denary value of -2 in binary
a)
00001001
b)
01001010
c)
10000010
d)
01000111
4.
Using two's complement, represent the denary value of 59 in binary
a)
111011
b)
001011
c)
001001
d)
011110
5.
Using two's complement, represent the denary value of 107 in binary
a)
1101011
b)
11100100
c)
10100000
d)
01100111
6.
Using two's complement, represent the denary value of -99 in binary
a)
1101011
b)
01001001
c)
01010110
d)
10011101
7.
Add the 2 following pairs of unsigned 8-bit binary integers: 10000100 + 01011101
a)
11100001
b)
11010010
c)
00001010
d)
10011011
8.
Convert 10101011 to denary
a)
183
b)
87
c)
171
d)
134
9.
Convert 01100110 to denary
a)
132
b)
102
c)
88
d)
119
10.
Convert the hex value F7 to denary
a)
247
b)
216
c)
218
d)
252
11.
Convert the denary value 198 to hexadecimal
a)
FB
b)
93
c)
AC
d)
C6
12.
Convert the denary value 214 to hexadecimal
a)
AD
b)
DF
c)
D6
d)
CB
13.
Identify if the floating point number 00011010 0010 is normalised or not
a)
true
b)
false
14.
What should a normalised floating poin number start with, give 1 example
a)
10
b)
11
15.
Convert the following floating point binary number to denary using 7 bits for the mantissa and 4 bits for the exponent: 0100101 0100
a)
7
b)
9.5
c)
8.25
d)
9.25
16.
An abstract data structure in which each element may be of a different type
a)
Array
b)
Tuple
c)
List
d)
Record
17.
A set of related data items stored under a single identifier. Can work on one or more dimensions.
a)
Array
b)
Tuple
c)
List
d)
Record
18.
An abstract data type that represents a countable number of ordered values,
a)
Array
b)
Tuple
c)
List
d)
Record
19.
A sequenced data structure similar to a record, however is immutable.
a)
Array
b)
Tuple
c)
List
d)
Record
20.
Removing an element
a)
POP
b)
PUSH
21.
Adding an element
a)
POP
b)
PUSH
22.
The first item added is the first item removed
a)
First in, First Out
b)
Last in, First Out
23.
The last item added is the first item removed
a)
First in, First Out
b)
Last in, First Out
24.
Stack
a)
First in, First Out
b)
Last in, First Out
25.
Queue
a)
First in, First Out
b)
Last in, First Out
26.
Once declared, contents cannot be changed
a)
Immutable
b)
Mutable
27.
Once declared, contents and structure can be changed
a)
Immutable
b)
Mutable
28.
Uses just one pointer
a)
Stack
b)
Queue
29.
Uses two pointers
a)
Stack
b)
Queue
30.
Size of the structure can change at run time
a)
Static
b)
Dynamic
31.
Size of the structure cannot change at runtime
a)
Static
b)
Dynamic
32.
Represents a path/link between two nodes in a graph
a)
Node
b)
Edge
33.
Each data item within a graph
a)
Node
b)
Edge
34.
Edges have value/weighting attached to them (e.g. time/distance)
a)
Undirected Graph
b)
Weighted Graph
c)
Adjacency Matrix
d)
Adjacency List
35.
Indiciates whether pairs of verticies are adjacent or not in the graph
a)
Undirected Graph
b)
Weighted Graph
c)
Adjacency Matrix
d)
Adjacency List
36.
Describes the set of neighbours of a vertex in the graph
a)
Undirected Graph
b)
Weighted Graph
c)
Adjacency Matrix
d)
Adjacency List
37.
A graph with edges containing no arrow heads
a)
Undirected Graph
b)
Weighted Graph
c)
Adjacency Matrix
d)
Adjacency List
38.
A node that has a parent node
a)
Root
b)
Parent
c)
Child
d)
Subtree
39.
A tree which is a child of a node, and a subst of a larger tree
a)
Root
b)
Parent
c)
Child
d)
Subtree
40.
A node that has an edge c onnected to a child node
a)
Root
b)
Parent
c)
Child
d)
Subtree
41.
The topmost node of a tree
a)
Root
b)
Parent
c)
Child
d)
Subtree
42.
Place the dot for tracking the output on the right of the node
a)
Pre-Order Traversal
b)
In-Order Traversal
c)
Post-Order Traversal
43.
Place the dot for tracking the output on the left of the node
a)
Pre-Order Traversal
b)
In-Order Traversal
c)
Post-Order Traversal
44.
Place the dot for tracking the output on the bottom of the node
a)
Pre-Order Traversal
b)
In-Order Traversal
c)
Post-Order Traversal
45.
You need to explore the roots before inspecting any leaves
a)
Pre-Order Traversal
b)
In-Order Traversal
c)
Post-Order Traversal
46.
You need to explore all the leaves before any nodes
a)
Pre-Order Traversal
b)
In-Order Traversal
c)
Post-Order Traversal
47.
You want to flatten the tree back into its original sequence
a)
Pre-Order Traversal
b)
In-Order Traversal
c)
Post-Order Traversal
48.
Used to get the values of nodes in non-decreasing order
a)
Pre-Order Traversal
b)
In-Order Traversal
c)
Post-Order Traversal
49.
Used to create a copy of a tree
a)
Pre-Order Traversal
b)
In-Order Traversal
c)
Post-Order Traversal
50.
Used to delete a tree from left to root
a)
Pre-Order Traversal
b)
In-Order Traversal
c)
Post-Order Traversal
51.
Notation for AND gates
a)
^
b)
V
c)
¬
d)
⊕
52.
Notation for NOT gates
a)
^
b)
V
c)
¬
d)
⊕
53.
Notation for OR gates
a)
^
b)
V
c)
¬
d)
⊕
54.
Notation for XOR gates
a)
^
b)
V
c)
¬
d)
⊕
55.
At which clock period does a D-type flip flop change
a)
Falling Edge
b)
Clock Width
c)
Clock Period
d)
Rising Edge
56.
State the purpose of a D type flip-flop
a)
To store the state of clock pulses
b)
To store the state of a bit
c)
To store logic gates
d)
To store calculations
57.
Rule in Boolean Algebra where the order of application of two separate terms is not important. E.G. A AND B = B AND A
a)
Distribution
b)
Association
c)
Commutation
d)
Double Negation
58.
Rule in Boolean Algebra where if you invert a term twice it is equal to its original term. E.G (NOT NOT A) = A
a)
Distribution
b)
Association
c)
Commutation
d)
Double Negation
59.
A rule in Boolean algebra which permits the removal of brackets from an expression and regrouping of the variables
a)
Distribution
b)
Association
c)
Commutation
d)
Double Negation
60.
A rule in Boolean algebra which permits the multiplying or factoring out of an expression
a)
Distribution
b)
Association
c)
Commutation
d)
Double Negation
61.
A unit which addes two inputs and a carry bit together
a)
Half Adder
b)
Full Adder
62.
A unit which addes together two inputs
a)
Half Adder
b)
Full Adder
63.
NOT 0
a)
0
b)
1
64.
0 AND 1
a)
0
b)
1
65.
0 OR 1
a)
0
b)
1
66.
0 NAND 1
a)
0
b)
1
67.
1 XOR 1
a)
0
b)
1
68.
0 NOR 1
a)
0
b)
1
69.
How many rows will a truth table with 1 input have
a)
2
b)
4
c)
8
d)
16
70.
How many rows will a truth table with 2 inputs have
a)
2
b)
4
c)
8
d)
16
71.
How many rows will a truth table with 3 inputs have
a)
2
b)
4
c)
8
d)
16
72.
How many rows will a truth table with 4 inputs have
a)
2
b)
4
c)
8
d)
16
100 %
