Data Structures - Link list does not have any advantage when compared to an Array.

GeekInterview.com > Interview Questions > Concepts > Data Structures

Go To First | Previous Question | Next Question

Data Structures | Question 55 of 202

Link list does not have any advantage when compared to an Array.

Skill/Topic: Linked List
A) True
B) False
Explanation: A linked list can grow and shrink in size dynamically at runtime, whereas an array is set to a fixed size at compile time.

Total Answers and Comments: 3

Last Update: December 28, 2007

Sponsored Links

Best Rated Answer

—

No best answer available. Please pick the good answer available or submit your answer.

January 19, 2006 07:40:37

samiksc

Member Since: October 2005 Contribution: 233

RE: Link list does not have any advantage when compare...

False: When you dont know in advance how many elements will be there linked list is more suitable than array.

Is this answer useful? Yes | No

September 03, 2007 10:22:43

Vikram.N

RE: Link list does not have any advantage when compare...

False: In linked list items can be inserted anywhere with O(1) while in an array you need to shift certain elements i.e O(n). Same applies to deletion. Also every node can contain multiple values.

Is this answer useful? Yes | No

December 28, 2007 02:30:37

manishmodgil

Member Since: July 2006 Contribution: 15

RE: Link list does not have any advantage when compared to an Array.

FALSE

Advantages of linked list :

1. Insertion and deletion are less costly.
2. Dynamic addition of new elements is possible.
3. Sorting is less costly.

Is this answer useful? Yes | No

Go To Top

User Name		Remember Me?
Password

Question Bank