Fichas
FMJC.C5
Fichas del conjunto (19)
- 1To add data to a queueCheck if queue = FULL
...if full then report error
Move the end pointer to point to new item
..inserts new data at end of queue - 2To remove data from a queueCheck if queue = EMPTY
...if empty then report error
Remove data that is at pointer
..move front pointer to next data item - 3How a binary tree worksStart at root
REPEAT
..compare new data with current data
..if new data < current then follow left point
...else follow right pointer
Until pointer is null
Write new data /Create null pointers - 4To delete items from a nodeTraverse tree until item is found
...and remove elements below item
..store them
...delete them
Transfer stored items back into tree - 5To traverse a tree (in order)Traverse left subtree
visit root
Traverse right subtree - 6What is meant by dynamic referring to data structuresSize changes as data is added
Size is not fixed - 7One disadvantage for dynamic compared to staticMore complex
Difficult program to write - 8One type of data structure that has to be staticAn Array
- 9Data is removed from the front Data is added at the back What is this data structure called?A queue
- 10State the meaning of static data structureSize is fixed when created
...cannot change when processing - 11One advantage of STATIC structureMemory size known
Easy to program - 12Why is a circular queue efficient?Easy to program (fixed sizes)
All available storage can be re-used - 13What situation will the free pointer and front pointer have the same valueWhen the queue is empty
- 14Adding item to a stackIf stack is full
..report error and stop
Else increment pointer
..add data to the pointer - 15Pop item from stackIf stack is empty
..report error and stop
Else remove data at the pointer
..decrement pointer - 16Advantage of binary search compared with serial searchFaster due to
...half being discarded at each step
...fewer to check - 17Steps of an insertion sortStep through the list
...taking each item and inserting in correct position
..relative to the item before it
..repeat until all items have been inserted in correct position - 18Quick SortSelect an item at random, call it a pivot
..Create two lists, one with items less than pivot, and one with items greater than
pivot.
Repeat until each list has only one item - 19Feature of Quick Sort that is not used in Insertion sortSet of values broken into less & greater
...than the chosen pivot
Uses pivots
Información
- Descripción
- Fichas sobre FMJC.C5, creado por FMJC. el 17/06/2015.
- Creado por
- FMJC.
- Visitas
- 1
- Valoración