Issues with array

What is disadvantage of array in Java?

• a) Arrays allow variable size changes.
• b) Arrays store multiple data types.
• c) Arrays offer easy insertion and deletion.
• d) Arrays have a fixed size, hindering size changes.

What are the challenges to using array?

• a) Insertion/deletion is simple and efficient.
• b) Memory wastage is eliminated in arrays.
• c) Arrays don't require consecutive memory storage.
• d) Insertion/deletion are complex due to consecutive memory, wastage from excess allocation.

Why arrays are difficult in Java?

• a) Indexing is unnecessary in arrays.
• b) Arrays are versatile with various data types.
• c) Beginners struggle with content distinction.
• d) Beginners struggle with indexing and content distinction, affecting usage.

What are the main disadvantages of arrays?

• a) Arrays have dynamic size changes.
• b) Arrays lack memory wastage.
• c) Arrays allow heterogeneous data storage.
• d) Fixed size, memory wastage, and complex insertion/deletion make arrays less versatile.

Why array is not thread safe in Java?

• a) Arrays are inherently thread-safe.
• b) Arrays' mutability enhances thread safety.
• c) Arrays are thread-safe when used carefully.
• d) Arrays' mutability makes them non-thread-safe; copying arrays is safer.

Is array type safe in Java?

• a) Immutable arrays are always thread-safe.
• b) Array type safety depends on the Java version.
• c) Mutable arrays are treated as immutable.
• d) Immutable arrays allow treating String[] as Object[], but mutable arrays don't.

What are the complexities of array?

• a) Array access complexity is O(n).
• b) Linear search complexity is O(1).
• c) Array access complexity is O(1).
• d) Linear search complexity is O(n).

Which of the following are disadvantages of arrays ?

• a) Arrays allow flexible memory usage.
• b) Arrays eliminate memory wastage.
• c) Arrays can adapt to changing needs.
• d) Fixed size leads to unutilized space and memory wastage.

What is the disadvantage of array in stack?

• a) Dynamic size adaptation for stacks.
• b) Efficient insertion/deletion in stacks.
• c) Fixed stack size limits memory usage.
• d) Stack array size is fixed, making dynamic changes and operations difficult.

Why array is faster than list Java?

• a) Arrays have variable memory allocation.
• b) Lists offer fixed memory allocation.
• c) Lists use arrays for dynamic memory.
• d) Arrays are faster due to fixed memory allocation compared to dynamic ArrayList.