Use LEFT and RIGHT arrow keys to navigate between flashcards;
Use UP and DOWN arrow keys to flip the card;
H to show hint;
A reads text to speech;
14 Cards in this Set
- Front
- Back
is used in sorting small lists by comparing each item and start at the leftmost end of the lists. |
Bubble Sort |
|
Performs numerous comparisons but fewer data movements |
Selection Sort |
|
does not perform exchanges items larger than the target slide to the right until the algorithm reaches the insertion point. |
Insertion Sort |
|
is an ordered list where all operations are restricted at one end of the list known as the top. Removing the item on top allows you to access the next to last item and so on. |
STACK |
|
adds item at the top |
PUSH |
|
removes element from the top |
POP |
|
accesses value at the top |
PEEK |
|
A ___ is a list of items that allows for access only at the two ends of the sequence, called the front and back of the queue, An item enters at the back and exits from the front |
queue |
|
to insert or add an element in a queue, it is always at the top of the list that the insertion takes place. You cannot insert an element at the middle or end of the lists. |
enqueue |
|
To dequeue an element in the list is to delete at the bottom of the lists. |
dequeue |
|
The retrieving of element in the queue is to simply print or display the element at the bottom of the list. Basically, what is being viewed or retrieved is what you are about the delete or remove and not what you have inserted. |
peek or retrieve |
|
if in any case, that the list is now empty and you tried retrieving element from the list, it should then return an error because the queue is now empty. On the other hand, it can also give you a message that the queue is full when trying to insert another element. |
empty and full |
|
the elements of the array are arranged in a circular manner. |
circular queue |
|
the elements in this queue are ordered, in an ascending or descending manner, based on some criterion. The element next to be removed is the one with the highest, or lowest, value in terms of the defined criterion. The criterion by which the queue is defined is such that the next element to be removed from the queue will always be located at the bottom. |
priority queue |