{"id":1559,"date":"2021-05-21T13:52:45","date_gmt":"2021-05-21T08:07:45","guid":{"rendered":"https:\/\/bcisnotes.com\/secondsemester\/?p=1559"},"modified":"2021-05-21T13:52:45","modified_gmt":"2021-05-21T08:07:45","slug":"difference-between-array-list-and-link-list-explain-uses-of-array-list","status":"publish","type":"post","link":"https:\/\/bcisnotes.com\/secondsemester\/q-a\/difference-between-array-list-and-link-list-explain-uses-of-array-list\/","title":{"rendered":"Difference between Array List and Link List? Explain uses of Array List with an example."},"content":{"rendered":"

Difference between Array List and Link List? Explain the uses of the Array List with an example.<\/h1>\n

The answer to the Difference between Array List and Link List? Explain uses of Array List with an example is given below:<\/p>\n\n\n\n\n\n\n\n\n\n\n\n\n\n
Parameters<\/strong><\/td>\nArray<\/strong><\/td>\nLinked List<\/strong><\/td>\n<\/tr>\n<\/thead>\n
Definition<\/td>\nIt is a collection of elements having the same data type with a common name.<\/td>\nIt is an ordered collection of elements that are connected by links or pointers.<\/td>\n<\/tr>\n
Size<\/td>\nFixed, once declared cannot be changed.<\/td>\nVariable, can be changed during run-time.<\/td>\n<\/tr>\n
Memory Allocation<\/td>\nRequire Contiguous blocks of memory.<\/td>\nRandom memory can be allocated.<\/td>\n<\/tr>\n
Access<\/td>\nDirect or randomly accessed, i.e., Specify the array index or subscript.<\/td>\nSequentially accessed, i.e., Traverse starting from the first node in the list by the pointer.<\/td>\n<\/tr>\n
Insertion and Deletion<\/td>\nRelatively slow, as to insert or delete an element, other elements need to be shifted to occupy the empty space or make space.<\/td>\nFaster, Easier and Efficient as just linking or unlinking of the node is required.<\/td>\n<\/tr>\n
Searching<\/td>\nBinary search and Linear search<\/td>\nLinear search<\/td>\n<\/tr>\n
Extra Space<\/td>\nExtra space is not required.<\/td>\nTo link nodes of the list, pointers are used which require extra space.<\/td>\n<\/tr>\n
Memory Utilization<\/td>\n\u00a0Array list is inefficient<\/td>\nLink list is efficient<\/td>\n<\/tr>\n
Types<\/td>\nIt can be single-dimensional, two dimensional or multi-dimensional.<\/td>\nIt can be singly,\u00a0doubly\u00a0or\u00a0circular\u00a0linked list.<\/td>\n<\/tr>\n<\/tbody>\n<\/table>\n

import java.util.ArrayList;
\nclass Test_ArrayList {
\npublic static void main(String[] args) {
\n\/\/Creating a generic ArrayList
\nArrayList<String> arlTest = new ArrayList<String>();
\n\/\/Size of arrayList
\nSystem.out.println(“Size of ArrayList at creation: ” + arlTest.size());
\n\/\/Lets add some elements to it
\narlTest.add(“D”);
\narlTest.add(“U”);
\narlTest.add(“K”);
\narlTest.add(“E”);<\/p>\n

\/\/Recheck the size after adding elements
\nSystem.out.println(“Size of ArrayList after adding elements: ” + arlTest.size());<\/p>\n

\/\/Display all contents of ArrayList
\nSystem.out.println(“List of all elements: ” + arlTest);<\/p>\n

\/\/Remove some elements from the list
\narlTest.remove(“D”);
\nSystem.out.println(“See contents after removing one element: ” + arlTest);<\/p>\n

\/\/Remove element by index
\narlTest.remove(2);
\nSystem.out.println(“See contents after removing element by index: ” + arlTest);<\/p>\n

\/\/Check size after removing elements
\nSystem.out.println(“Size of arrayList after removing elements: ” + arlTest.size());
\nSystem.out.println(“List of all elements after removing elements: ” + arlTest);<\/p>\n

\/\/Check if the list contains “K”
\nSystem.out.println(arlTest.contains(“K”));<\/p>\n

}
\n}<\/p>\n

You may also like\u00a0Pokhara University, 2016 Fall Object Oriented Language<\/a><\/p>\n

<\/div>