NEW
Font size
S
M
L
XL
WorksheetsAS Computing: Data Structures
Total questions: 15
Worksheet time: 10mins
Name
Class
Date
1.
What is a data structure?
a)
A method of arranging data
b)
A way of keeping data without an order?
c)
A "stack" only
d)
There is no formal definition for "Data Structure"
2.
What kind of Data structure would you expect to find utilised to store operations in a CPU?
a)
Stack
b)
Queue
c)
List
d)
Tree
3.
In computing, What is FILO?
a)
First In First Out
b)
First In Last out
c)
Last Out Lowest Order
d)
A very thin unleavened dough used for making pastries such as baklava and börek in Middle Eastern and Balkan cuisines.
4.
Which of these data structures is FIFO?
a)
Stack
b)
Queue
c)
Binary Tree
d)
Double linked list
5.
A stack overflow is an undesirable condition in which a particular computer program tries to use more memory space than the called stack has available.
a)
True
b)
False
6.
What would 'leaving' a queue be called?
a)
"Dequeue"
b)
"Enqueue"
c)
"Leave queue"
d)
"Delete 'system 32' folder"
7.
In this tree, where would the new value "7" be placed?
a)
On the left "leaf" of "4"
b)
On the right "leaf" of "6"
c)
On the left "leaf" of "15"
d)
Over the top of the current number "5"
8.
What would a dynamic data structure entail?
a)
Memory is allocated to the data structure as the program executes.
b)
Memory is allocated to the data structure at compile time.
c)
The size of the structure is fixed
d)
The data structure can also double as TNT
9.
Which of these sorting methods uses "divide and conquer"?
a)
Bubble Sort
b)
Quick Sort
c)
Cocktail Sort
d)
Selection Sort
10.
A strength of Linear searches is that they can be performed without sorting the list before hand...
a)
True
b)
False
11.
A Binary search requires the data it is searching to be ordered in some way...
a)
True
b)
False
12.
Which of these describes the operation of a bubble sort?
a)
The lowest valued un-ordered item will move quickest during a bubble sort
b)
The Highest valued un-ordered item will move quickest during a bubble sort
c)
The list will be divided again and again, then re-build in to the correct order
d)
The list will be divided by a pivot, then ordered in smaller groups
13.
For a ordered list of 11 items, how many comparisons will a linear search need before it knows that a value in NOT in the list?
a)
12
b)
11
c)
6
d)
4
14.
For a ordered list of 11 items, how many comparisons will a Binary search need before it knows that a value in NOT in the list?
a)
12
b)
11
c)
6
d)
4
15.
For a linked list, what meta-data will need to be stored with each data entry?
a)
The Name of the list
b)
The address of the current data entry
c)
The address of the next data entry in the list
d)
The meaning of life
Reset
