Which container demands a single, perfectly unbroken block of memory to store its data?, Array, Deque, Both of them, Neither of them, What does the name "Deque" actually stand for?, Data Equation, Dynamic Element Query, Double-Ended Queue, Derived Queue, If you force a new element into the very front (index 0) of an Array-backed structure, what must happen to the rest of the data?, Nothing, it just slides in., Every other element must shift one space to the right., The last element gets deleted., The array splits into two pieces., Which container's exact size must be known before you even run the program, and absolutely cannot grow once created?, Array, Deque, Both of them, Neither! Both are slow at middle insertions., If you force a new person into the very front of an Array line, what happens to everyone else?, Nothing, they stay still., Every single person has to step back one spot to make room (which is slow)., The person at the end of the line gets kicked out., Both option B and option C, What is the special "superpower" of a Deque?, It can sort numbers automatically., It allows you to easily add or remove items from BOTH the front and the back., It uses zero memory., None of the above, Think of a Pringles can. It has a specific size, and you can only easily take chips from the top. Which container is most like a Pringles can?, Array, Deque, Both , None, Which concept Deque generalizes?, LIFO, FIFO, BOTH, NONE, A sneaky VIP wants to cut the line and jump into the very front of your data container. Which container lets them do this instantly?, Array, Deque, BOTH, NONE, You want to squeeze a new number right into the exact middle of your data. Both Arrays and Deques are slow at doing this. Why?, Because the computer runs out of power., Because they have to shift the other items out of the way to make room., Because numbers don't like being crowded., None.

Sequence Structure : Deque ,Array

par
Imprimer
Incorporer

Classement

Style visuel

Options

Changer de modèle

Restauration auto-sauvegardé :  ?