C Sharp (C#) - Collections
Why do collections like
List<T> generally perform better than arrays when frequently adding or removing elements?Why do collections like List<T> generally perform better than arrays when frequently adding or removing elements?
hard🧠 Conceptual Q10 of 15
Step-by-Step Solution
Solution:
Step 1: Understand array resizing
Arrays have fixed size; resizing requires creating a new array and copying elements manually.Step 2: Understand collection resizing
Collections like List<T> handle resizing internally and provide optimized methods for adding/removing.Final Answer:
Collections use internal resizing and optimized methods, arrays require manual resizing. -> Option AQuick Check:
Internal resizing optimization = C [OK]
Quick Trick: Collections handle resizing internally; arrays need manual resizing [OK]
Common Mistakes:
MISTAKES- Believing arrays resize automatically
- Thinking collections use linked lists internally
- Assuming arrays have add/remove methods
Master "Collections" in C Sharp (C#)
Want More Practice?
15+ quiz questions · All difficulty levels · Free
Free Signup - Practice All QuestionsMore C Sharp (C#) Quizzes