Concept: simple fillable arrays Assume the back index in a simple fillable array

Question

Concept: simple fillable arrays Assume the back index in a simple fillable array points to the first available slot. 178. What is not a property of a simple fillable array? (C) elements are presumed to be contiguous (A) elements can be added in constant time B) there exists an element that can be removed in con (D) the underlying simple array can increase in size stant time 179. What is a property of a simple fillable array? (A) any element can be removed in constant time (B) an element can be added anywhere in constant time (C) elements are presumed to be contiguous (D) more that one element can be next to an empty slot 180. Adding an element at back of a simple fillable array can be done in: (A) logarithmic time (B) quadratic time (C) linear time (D) constant time

Explanation / Answer

178)

Answer: D

Explanation:

once capacity is fixed

then size can't be increased

179)

Answer: C

Explanation:

elements inserted must be contiguous

180)

Answer: D

Explanation:

done in constant time

assigning new value

and

just need to increment size variable

181)

Answer: A

explanation:

need to shift all the elements

in array...takes linear time

182)

Answer: D

Explanation:

placed at s, then s incremented

183)

Answer: D

Related Questions

Navigate

• Browse (All)
• Browse C
• Subjects

---

---

Integrity-first tutoring: explanations and feedback only — we do not complete graded work. Learn more.