Have an account?
Skip to Content
Build your own quiz
Suggestions for you
15 questions
Show Answers
See Preview
- 1. Multiple Choice
What kind of Data structure would you expect to find utilised to store operations in a CPU?StackQueueListTree - 2. Multiple ChoiceIn computing, What is FILO?First In First OutFirst In Last outLast Out Lowest OrderA very thin unleavened dough used for making pastries such as baklava and börek in Middle Eastern and Balkan cuisines.
- 3. Multiple ChoiceWhich of these data structures is FIFO?StackQueueBinary TreeDouble linked list
- 4. Multiple ChoiceA stack overflow is an undesirable condition in which a particular computer program tries to use more memory space than the called stack has available.TrueFalse
- 5. Multiple ChoiceWhat would 'leaving' a queue be called?"Dequeue""Enqueue""Leave queue""Delete 'system 32' folder"
- 6. Multiple ChoiceIn this tree, where would the new value "7" be placed?On the left "leaf" of "4"On the right "leaf" of "6"On the left "leaf" of "15"Over the top of the current number "5"
- 7. Multiple ChoiceWhat would a dynamic data structure entail?Memory is allocated to the data structure as the program executes.Memory is allocated to the data structure at compile time.The size of the structure is fixedThe data structure can also double as TNT
- 8. Multiple ChoiceWhich of these sorting methods uses "divide and conquer"?Bubble SortQuick SortCocktail SortSelection Sort
- 9. Multiple ChoiceA strength of Linear searches is that they can be performed without sorting the list before hand...TrueFalse
- 10. Multiple ChoiceA Binary search requires the data it is searching to be ordered in some way...TrueFalse
- 11. Multiple ChoiceWhich of these describes the operation of a bubble sort?The lowest valued un-ordered item will move quickest during a bubble sortThe Highest valued un-ordered item will move quickest during a bubble sortThe list will be divided again and again, then re-build in to the correct orderThe list will be divided by a pivot, then ordered in smaller groups
- 12. Multiple ChoiceFor 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?121164
- 13. Multiple ChoiceFor 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?121164
- 14. Multiple ChoiceFor a linked list, what meta-data will need to be stored with each data entry?The Name of the listThe address of the current data entryThe address of the next data entry in the listThe meaning of life
- 15. Multiple ChoiceWhat is a data structure?A method of arranging dataA way of keeping data without an order?A "stack" onlyThere is no formal definition for "Data Structure"
- Answer choicesTagsAnswer choicesTags