LINEAR DATA STRUCTURES EXAM
WITH CORRECT ANSWERS
Array data structure - Correct Answers -In computer science, an array data structure, or
simply an array, is a data structure consisting of a collection of elements (values or
variables), each identified by at least one array index or key. An array is stored such
that the position of each element can be computed from its index tuple by a
mathematical formula.[1][2][3] The simplest type of data structure is a linear array, also
called one-dimensional array.
Bit array - Correct Answers -A bit array (also known as bit map, bit set, bit string, or bit
vector) is an array data structure that compactly stores bits. It can be used to implement
a simple set data structure. A bit array is effective at exploiting bit-level parallelism in
hardware to perform operations quickly. A typical bit array stores kw bits, where w is the
number of bits in the unit of storage, such as a byte or word, and k is some nonnegative
integer. If w does not divide the number of bits to be stored, some space is wasted due
to internal fragmentation.
Bit field - Correct Answers -A bit field is a data structure used in computer programming.
It consists of a number of adjacent computer memory locations which have been
allocated to hold a sequence of bits, stored so that any single bit or group of bits within
the set can be addressed.[1][2] A bit field is most commonly used to represent integral
types of known, fixed bit-width.
Dynamic array - Correct Answers -In computer science, a dynamic array, growable
array, resizable array, dynamic table, mutable array, or array list is a random access,
variable-size list data structure that allows elements to be added or removed. It is
supplied with standard libraries in many modern mainstream programming languages.
Dynamic arrays overcome a limit of static arrays, which have a fixed capacity that needs
to be specified at allocation.
Gap buffer - Correct Answers -A gap buffer in computer science is a dynamic array that
allows efficient insertion and deletion operations clustered near the same location. Gap
buffers are especially common in text editors, where most changes to the text occur at
or near the current location of the cursor. The text is stored in a large buffer in two
contiguous segments, with a gap between them for inserting new text. Moving the
cursor involves copying text from one side of the gap to the other (sometimes copying is
delayed until the next operation that changes the text). Insertion adds new text at the
end of the first segment; deletion deletes it.
WITH CORRECT ANSWERS
Array data structure - Correct Answers -In computer science, an array data structure, or
simply an array, is a data structure consisting of a collection of elements (values or
variables), each identified by at least one array index or key. An array is stored such
that the position of each element can be computed from its index tuple by a
mathematical formula.[1][2][3] The simplest type of data structure is a linear array, also
called one-dimensional array.
Bit array - Correct Answers -A bit array (also known as bit map, bit set, bit string, or bit
vector) is an array data structure that compactly stores bits. It can be used to implement
a simple set data structure. A bit array is effective at exploiting bit-level parallelism in
hardware to perform operations quickly. A typical bit array stores kw bits, where w is the
number of bits in the unit of storage, such as a byte or word, and k is some nonnegative
integer. If w does not divide the number of bits to be stored, some space is wasted due
to internal fragmentation.
Bit field - Correct Answers -A bit field is a data structure used in computer programming.
It consists of a number of adjacent computer memory locations which have been
allocated to hold a sequence of bits, stored so that any single bit or group of bits within
the set can be addressed.[1][2] A bit field is most commonly used to represent integral
types of known, fixed bit-width.
Dynamic array - Correct Answers -In computer science, a dynamic array, growable
array, resizable array, dynamic table, mutable array, or array list is a random access,
variable-size list data structure that allows elements to be added or removed. It is
supplied with standard libraries in many modern mainstream programming languages.
Dynamic arrays overcome a limit of static arrays, which have a fixed capacity that needs
to be specified at allocation.
Gap buffer - Correct Answers -A gap buffer in computer science is a dynamic array that
allows efficient insertion and deletion operations clustered near the same location. Gap
buffers are especially common in text editors, where most changes to the text occur at
or near the current location of the cursor. The text is stored in a large buffer in two
contiguous segments, with a gap between them for inserting new text. Moving the
cursor involves copying text from one side of the gap to the other (sometimes copying is
delayed until the next operation that changes the text). Insertion adds new text at the
end of the first segment; deletion deletes it.
