+1 vote
in Data Structures & Algorithms I by (110k points)
Array is divided into two parts in ____________

(a) Hashed Array Tree

(b) Geometric Array

(c) Bounded-size dynamic array

(d) Sparse Array

I need to ask this question from Dynamic Array in portion Arrays Types of Data Structures & Algorithms I

This question was posed to me in an internship interview.

1 Answer

+1 vote
by (444k points)
selected by
Best answer
The correct choice is (c) Bounded-size dynamic array

Explanation: The first part stores the items of the dynamic array and the second part is reserved for new allocations.

Related questions

Welcome to TalkJarvis QnA, a question-answer community website for the people by the people. On TalkJarvis QnA you can ask your doubts, curiosity, questions and whatever going in your mind either related to studies or others. Experts and people from different fields will answer.