This question is related to data structures
Fill in the blank:

"_________ data structures can change size as needed, growing or shrinking depending on how much data you have. This is more flexible but can be more complex to work with and might use a lot of memory."

Which of the following answers is true about One-dimensional arrays? (Select all that apply)

• Arrays are static: Once created, their size can't change.

• Elements are ordered: They are stored in a specific sequence, which makes searching efficient.

• Once the arrays are created, their size can be change

• None of the above

Answer explanation

Arrays are like lists of elements, each with a specific position (index) used for access.

Key points:

• Arrays are static: Once created, their size can't change.

• Elements are ordered: They are stored in a specific sequence, which makes searching efficient.

• Indexing starts at 0: The first element is at position 0, the second at position 1, and so on.

Based on the two-dimensional array shown, should be typed in order to output "Alice"?

Based on the three-dimensional array shown, should be typed in order to output 27?

This question is related to Big O notation:

Which of the following is true about O(n²)?

• This means the time grows much faster as the data increases, like the square of the data size. This is common in algorithms with nested loops (loops inside loops).

• • This means the time it takes grows directly with the amount of data.

  Eg, searching a list one by one for a specific item gets slower as the list gets longer.

• • This means the algorithm takes the same amount of time no matter how much data it has.

  Eg, finding the first item in a list is always quick, regardless of the list's length.

• None of the above

Which of the following examples best describes O(n)?

• Imagine you're looking for a friend's house in a neighbourhood.

  You know the exact address and go straight there. It takes the same amount of time whether the neighbourhood is big or small.

• Imagine you're looking for a friend's house in a neighbourhood. You're lost and have to check every house on every street. This takes much longer as the neighbourhood gets bigger.

• Imagine you're looking for a friend's house in a neighbourhood.You don't know the address, so you ask each house until you find the right one. The more houses, the longer it takes.

Answer explanation

Based on the tuple shown, what shoul be typed to output 30?

Based on the above shown list, what should be typed if you want insert "grape" into the list ?

Based on the list shown, what should be typed if you want to insert "pear" as index 1?

Which of the following bit-strings are two’s complement representations of positive numbers?

• 11101010

• 10100001

• 01011010

• 00110110