False: When you dont know in advance how many elements will be there linked list is more suitable than array.
IN THE SEARCH CASE,LINKED LIST DOES NOT HAVE ANY ADVANTAGE THAN ARRAY.BECUASE LINKED LIST ALLOWS ONLY THE LINEAR SERCHING METHOD TO SEARCH THE DATAELMENTS,WHEREAS ARRAY PROVIDES OTHER MORE EFFICIENT METHOD TO SEARCH THAT'S DATA ELEMENTS.
The one advantage array has, the array elements are store sequential in memory but this is not the case with link list, which gives advantage to access fast memory for array
Arrays & Linked list both working mechanisms are in linear...
In arrays we dynamically specify no. of locations we need and change the size of the array.. But when insert the element in the list we have to shifting all the remaining elements to left or right .
In searching arrays & linked list both supports divide & concur.
But the over head in linked list maintaining extra memory pointers for traversing list.
But in arrays we use base address then we traverse the list