Arrays Are Linear Data Structure

7/31/2019 Arrays Are Linear Data Structure

1/15

arrays are linear datastructurewhile linked lists arelinear and non-linearin case of linked list:-from point of accessstrategy itis linear and frompoint of storagestrategy it is nonlinear

Is This

Answer

Correct ?

51

Yes

11No

5 SumitThokal

Re: what is the difference between arrays and linked list

Answer#2

Array is a simple sequenceof numbers which are notconcerned about each-others positions. they are

independentof each-others positions.adding,removing ormodifying anyarray element is veryeasy.Compared to arrays,linked listis a comlicated sequenceof numbers.each number inthelinked list is connectedto its previous & next no.via a

link which is nothieng buta pointer.Addition,removalofno.s in linked list isrelated to this pointerdirection &linking that no. to theno. which is alreadypresent in thelist.

Is This Answer

Correct ?

33

Yes

14 No

1 Kshama
http://www.allinterview.com/viewpost/9146.htmlhttp://www.allinterview.com/viewpost/9146.htmlhttp://www.allinterview.com/viewpost/9146.htmlhttp://www.allinterview.com/viewpost/9146.html


2/15


Answer#3

In arrays v cant delete

elements in middle but inLinkedlist v can do this.

Is This Answer

Correct ?

21

Yes

32 No

1 Anu


Answer#4>Array is a simplesequence of numbers whichare not>concerned about each-others positions.This is not true, whatabout arrays of objects ?They may beconcerned about each otherin some way.

>adding,removing ormodifying any arrayelement is very >easy.

This is untrue also,adding, removing elementsin array issignificantly more complexthan removing or addingelementsin linked list. This isbecause removing elementsfrom arraycauses all elements afterit to be shifted back,whereaswith linked list, itsmerely traversing the listto find thenode, previous node, andthe next node and settingpointers,and inserting element intoarray will probably callfor1) resizing the wholearray size (ie. assingning

5 Jaroosh
http://www.allinterview.com/viewpost/34125.htmlhttp://www.allinterview.com/viewpost/34125.htmlhttp://www.allinterview.com/viewpost/34125.htmlhttp://www.allinterview.com/viewpost/41323.htmlhttp://www.allinterview.com/viewpost/41323.htmlhttp://www.allinterview.com/viewpost/41323.htmlhttp://www.allinterview.com/viewpost/41323.htmlhttp://www.allinterview.com/viewpost/34125.html


3/15

a new,bigger memory chunk forit)2) copying elements fromthe former smaller arrayto the new

- bigger one.This is a huge trade off,provided that in list, itssimplymatter of setting the NEXTpointer of one of thenodes.

Main differences betweenthe two are:1) arrays are RANDOMACCESS structures, whereyou can accesselements in random/indexed

manner, whereas list is asequential accessstructure. This makes suchalgorithms likeheap sort or binary searchto work much faster onarrays2) arrays are static/fixedsize whereas lists aredynamicsize structures. It meansthat when creating anarray (both

on stack or heap), youHAVE to specify its size.With lists,you just create an emptylist and freely expand it3) array consist ofcontinuous chunks ofmemory, ie. nthelement is at the memorylocation of :address_of_array +sizeof(array_element_type)* nthis always holds true,

that is why following willalways work :for(int i=0;i dynamicmemory allocation.i.e we assign memory tothe particular element atrun-time..

hence we reserve only theamount of memory which isrequired.

there is no problem ofmemory shortage or

wastage, inlinked list. which we veryfrequently come accross inthearrays..

Is This Answer

Correct ?39 Yes

4 No

3 Shruti


Answer#6

Both are nothing but thedata structures where inarraysdata can be accessed usingsubscript but in linkedlistdata can be accessed bythe pointer present in itsprevious

0 Yoga
http://www.allinterview.com/viewpost/88699.htmlhttp://www.allinterview.com/viewpost/88699.htmlhttp://www.allinterview.com/viewpost/88699.htmlhttp://www.allinterview.com/viewpost/101927.htmlhttp://www.allinterview.com/viewpost/101927.htmlhttp://www.allinterview.com/viewpost/101927.htmlhttp://www.allinterview.com/viewpost/101927.htmlhttp://www.allinterview.com/viewpost/88699.html


5/15

node...

Is This Answer

Correct ?19 Yes

3 No


Answer#7

in a linked list data areaccessed by a means ofpointerWHILE linear arrayaccessed by a means ofsubcriptinsertion, deletion is

very easy with lineararray whilein a linked list is a

little bits complex

Is This Answer

Correct ?6 Yes

16 No

0 Mesole


Answer#8

an array is changablelength.a list does not.

Is This AnswerCorrect ?4 Yes

27 No

0 Harikrishnan


Answer#9

1.array is fixed lengthand Array is a simplesequence ofnumbers which are notconcerned about each-others positionsbut linked list is

variable length2.in array values areaccessing easy but linkedlist issome time taken processbcoz search aither forwordorbackword3.in array updatingoperations are time taken

0 Vasu Kanneganti
http://www.allinterview.com/viewpost/108888.htmlhttp://www.allinterview.com/viewpost/108888.htmlhttp://www.allinterview.com/viewpost/108888.htmlhttp://www.allinterview.com/viewpost/131485.htmlhttp://www.allinterview.com/viewpost/131485.htmlhttp://www.allinterview.com/viewpost/131485.htmlhttp://www.allinterview.com/viewpost/137002.htmlhttp://www.allinterview.com/viewpost/137002.htmlhttp://www.allinterview.com/viewpost/137002.htmlhttp://www.allinterview.com/viewpost/137002.htmlhttp://www.allinterview.com/viewpost/131485.htmlhttp://www.allinterview.com/viewpost/108888.html


6/15

comparingwith linkedlist4.array is not growble andlinkedlist is growble

Is This Answer

Correct ?

13 Yes

2 No


Answer#10

the main difference isthat in array data is notlinked toeach other but in linkedlists data is connected toeachother as every node is

connected to previousnode.

Is This Answer

Correct ?9 Yes

3 No

0 Bhumika Garg


Answer#11

All elements of arraystored in contiguousmemory location.

While in case of linkedlist each node does notstored incontiguous memory location

Is This Answer

Correct ?9 Yes

2 No

0 Priya


Answer

#12

1)Array has a static

storage where as in linkedlist it isdynamic.2)To add some elements inan array is impossiblesince thesize is predefined.For thesame case we can addelements atthe beginning,in the

0 Soumen Goswami


7/15

middle and also in theend.3)To access the data fromarray is very easy whileto accessdata from linked list is

some complex.

Is This Answer

Correct ?6 Yes

3 No


Answer#13

In array,memory is managedrandomly...but, in linked list memoryis managed in a heap

concept..

Is This Answer

Correct ?9 Yes

3 No

0 Shweta


Answer#14

array is easy tounderstand bt linked list-very difficult .

Is This Answer

Correct ?7 Yes

4 No

0 Prabhjot Singh


Answer#15

ArraysStrengths

1.Easy to use2.No memory managementneeded

3.Can access any elementby index4.Fairly quick to loopWeaknesses

1.Static size (cant

increase the size)2.Most likely not enoughor too much memory (younever know

0 Durairaj


8/15

how many elements areneeded)Linked ListsStrengths

1.Dynamic size (can

increase or decrease thelist)2.No memory is wastedWeaknesses

1.Lots of overhead code(lots of malloc calls andassigningpointers)2.Must traverse entirelist to go to the nthnode.Now I know that otherlanguages such as C# and

Java havebetter data structuresthan arrays and linkedlists (likeArrayLists and Vectors),but this is for the Clanguage andit doesnt have those. So

based on what youve read

aboveyou can decide which isbetter for the job needed.Neither

arrays nor linked listsare better but they dohave theirspecific purposes.

Is This Answer

Correct ?9 Yes

1 No


Answer

#16

array

for one type of data (like int array , chararray )memory should be kept intrack and managed by theuser.

linked list for multipletype of data

0 Karthikeyan
http://www.allinterview.com/viewpost/218287.htmlhttp://www.allinterview.com/viewpost/218287.htmlhttp://www.allinterview.com/viewpost/218287.htmlhttp://www.allinterview.com/viewpost/218287.html


9/15

Arrays and Linked list both are list data structures used for maintaining a list of values. Arrays usesequential allocation while Linked list uses linked allocation. > Linked list uses some extra memory i.e.link pointer. > Indexing an element, e.g. accessing kth element is cheaper in arrays and costly inLinked list.> Insertion and Deletion of elements is a cheaper operation in Linked lists.> Since nodes inLinked list are dynamically allocated, it has no limitations on growth (apart from memory constraints).> Merging Lists is easier in case of Linked lists. > Breaking a List into two or more lists is easier in caseof Linked lists.so Linked list is a better data structure in most cases. Arrays are goos mostly for staticdata structures.

Above answer was rated as good by the following members:lkaur

November 06, 2006 06:51:16

Is This Answer

Correct ?2 Yes

3 No

Re: what is the difference between arrays and linked listAnswer

#17arrays: staticalyallocating memoryeasy to traversememory wastage

linked list:runtimeallocationdifficult to traverseefficient usag of memory

Is This Answer

Correct ?

3 Yes

1 No

0 Thanu


Answer#18

arrey is very fast inlinked list.

Is This Answer

Correct ?1 Yes

1 No

0 Mehdin
http://www.geekinterview.com/user-profile/375859http://www.geekinterview.com/user-profile/375859http://www.allinterview.com/viewpost/248567.htmlhttp://www.allinterview.com/viewpost/248567.htmlhttp://www.allinterview.com/viewpost/248567.htmlhttp://www.allinterview.com/viewpost/263642.htmlhttp://www.allinterview.com/viewpost/263642.htmlhttp://www.allinterview.com/viewpost/263642.htmlhttp://www.allinterview.com/viewpost/263642.htmlhttp://www.allinterview.com/viewpost/248567.htmlhttp://www.geekinterview.com/user-profile/375859


10/15

mahesh

RE: What are the differences between Arrays and Linked...

arrays cannot be expanded or increased so we use linked list for dynamic data storage

Is this answer useful?Yes|No

November 07, 2006 07:33:19

shekhar


For example::

We want to delete some elements from array then either we have to place zero or we need torearrange it.

For dynamic deletion and insertion linked list is used instead arrays.

But if we do not need these operations then using arrays is sufficient and easier too.


November 14, 2006 05:13:03
http://www.geekinterview.com/question_details/37504http://www.geekinterview.com/question_details/37504http://www.geekinterview.com/question_details/37504http://www.geekinterview.com/question_details/37504http://www.geekinterview.com/question_details/37504http://www.geekinterview.com/question_details/37504http://www.geekinterview.com/question_details/37504http://www.geekinterview.com/question_details/37504http://www.geekinterview.com/question_details/37504http://www.geekinterview.com/question_details/37504http://www.geekinterview.com/question_details/37504http://www.geekinterview.com/question_details/37504http://www.geekinterview.com/question_details/37504/replyhttp://www.geekinterview.com/question_details/37504/replyhttp://www.geekinterview.com/question_details/37504/replyhttp://www.geekinterview.com/question_details/37504/replyhttp://www.geekinterview.com/question_details/37504http://www.geekinterview.com/question_details/37504http://www.geekinterview.com/question_details/37504http://www.geekinterview.com/question_details/37504


11/15

rathnam


space/time trade-off are the parameters to differentiate between them.

Space:

In the case of Arrays: for storing 10 elements we need only 10* sizeof(element) bytes.

In the case of Lists: for storing 10 elements we need at least 10*(sizeof(element)+sizeof(int*));

so we need more space in the case of linked lists to store the same data when compared to lists.

> Arrays are better;

Time:

In the case of Array indexing is possible so it takes constant time to access a particular data item. Butwhere as in the case of lists random access is not possible it takes variable amount of time to access aparticular data item.

> Arrays are better.

Misselleneous:

1) Some data structures can be represented easily with linked lists when compared to arrays.

2) Addition and Deletion is easier in the case of lists.

3) making a copy is easier in the case of Arrays because the memory is contigeous.


December 27, 2006 12:17:40
http://www.geekinterview.com/question_details/37504http://www.geekinterview.com/question_details/37504http://www.geekinterview.com/question_details/37504http://www.geekinterview.com/question_details/37504http://www.geekinterview.com/question_details/37504http://www.geekinterview.com/question_details/37504http://www.geekinterview.com/question_details/37504/replyhttp://www.geekinterview.com/question_details/37504http://www.geekinterview.com/question_details/37504


12/15

Manoj


Arrays and Linked list both are list data structures used for maintaining a list of values. Arrays usesequential allocation while Linked list uses linked allocation. > Linked list uses some extra memory i.e.link pointer. > Indexing an element e.g. accessing kth element is cheaper in arrays and costly in Linkedlist.> Insertion and Deletion of elements is a cheaper operation in Linked lists.> Since nodes in Linkedlist are dynamically allocated it has no limitations on growth (apart from memory constraints). >Merging Lists is easier in case of Linked lists. > Breaking a List into two or more lists is easier in case ofLinked lists.so Linked list is a better data structure in most cases. Arrays are goos mostly for static data

structures.

Is this answer useful?Yes|No 1 0 Overall Rating:+1

January 29, 2007 03:49:57

Arup Ratan Banerjee


All the above statements reveal that link list is of better data structure than that of Array.But if wewant to perform Sorting ( Ex: Bubble Sort Insertion Sort Quick Sort) by means of Link List then the timecomplexity will be much more than that of implementing the same with an Array


March 02, 2007 03:27:21
http://www.geekinterview.com/question_details/37504http://www.geekinterview.com/question_details/37504http://www.geekinterview.com/question_details/37504http://www.geekinterview.com/question_details/37504http://www.geekinterview.com/question_details/37504http://www.geekinterview.com/question_details/37504http://www.geekinterview.com/question_details/37504http://www.geekinterview.com/question_details/37504http://www.geekinterview.com/question_details/37504http://www.geekinterview.com/question_details/37504http://www.geekinterview.com/question_details/37504http://www.geekinterview.com/question_details/37504http://www.geekinterview.com/question_details/37504/replyhttp://www.geekinterview.com/question_details/37504/replyhttp://www.geekinterview.com/question_details/37504/replyhttp://www.geekinterview.com/question_details/37504/replyhttp://www.geekinterview.com/question_details/37504/replyhttp://www.geekinterview.com/question_details/37504/replyhttp://www.geekinterview.com/question_details/37504/replyhttp://www.geekinterview.com/question_details/37504/replyhttp://www.geekinterview.com/question_details/37504http://www.geekinterview.com/question_details/37504http://www.geekinterview.com/question_details/37504http://www.geekinterview.com/question_details/37504


13/15

sumit.manchanda


Arrays are stored in contigious memory ie (if suppose arr[12] is an integer array containing 12 elemnts if memorist elemnt is say 1088 then memoy address of next element in array would be 1090 & the next memory address w1092 as size of an integer value is 2 bytes) where as in linked lists it is not the case. In linked lists elements are contigious memory allocations in linklists every node contins a pointer which contains the address of next node


Storage:

1) Arrays are statically allocated whereas linked list are dynamically allocated and linked.General

number of allocations are known before hand, we use arrays. Otherwise linked list

Performance:

2) Array is a high performance way of storing a group of data because each element is laid out nex

neighbor in memory. This allows for very fast access because (a) the code can do a little math and j

quickly to any location in the array, and (b) the elements are all grouped together so they tend to b

memory at the same time (fewer page faults and cache misses).

3) If you want to index by something like a string, you could use a hash table. Lets say you have a l

players, and you want to pull an object up from each player's name. You take the string, run a has

to convert that into a number that falls within the range of an array, and store it in that element.

Or, you can have a linked list faster by breaking it into subelements. For example, if you were stor

a dictionary, you could have an array of linked lists with 26 entries for a-z. That way when you ma

list, you are manipulating a much smaller subset.

Thanks

Suresh Said..According to me Arrays can't declared dynamically.i.e they can't allocate memory dynamically. when evto add more eliments than the size of Array it is not possible.

In the case of Linked lists we can dynamically create any no of nodes and insert them at any point.And deliments,insert eliment in the middle is also more easy here.
http://www.geekinterview.com/question_details/37504http://www.geekinterview.com/question_details/37504http://www.geekinterview.com/question_details/37504http://www.geekinterview.com/question_details/37504http://www.geekinterview.com/question_details/37504http://www.geekinterview.com/question_details/37504http://www.geekinterview.com/question_details/37504/replyhttp://www.geekinterview.com/question_details/37504/replyhttp://www.geekinterview.com/question_details/37504http://www.geekinterview.com/question_details/37504


14/15

Not only that If we want to store 10 eliments,inarrays we need 10*(Size of datatype) bytes contiguous mlocations. But in Linked lists there is no need of contiguous memory locations.

But both have their own features,and disadvantages, at that time situation we should have deside which o

our applications.ThankU

Arrays are stored in contigious memory ie (if suppose arr[12] is an integer array containing 12 elemnts, iaddress of ist elemnt is say 1088 then memory address of next element in array would be 1090 & the nexaddress would be 1092 as size of an integer value is 2 bytes) whereas in linked lists it is not the case. Inelements are not stored in contigious memory allocations, in linklists every node contins a pointer whic

the address of next node in linked list.

poo Said..nice

Register orLogin to Post Your Opinion

Related Questions & Answers:What is the difference between yielding and

sleeping?

Difference between Microsoft.net Framework 2.0

and 3.5

Leader vs Manager- Difference betweenmanagement and leadership?

What is difference between "is" and "as" keyword

in C#?Please tell me whether OBJECT WEBTECHNOLOGIES ( www.owgroups.com ) at

kolkata is genuine or fraud

1.give one example for runtime polymorphism. 2.difference between compiletime poly and runtime

poly
http://www.techbaba.com/Register.aspx?pageurl=http://www.techbaba.com/q/3019-difference+arrays+linked+list.aspxhttp://www.techbaba.com/Login.aspx?pageurl=http://www.techbaba.com/q/3019-difference+arrays+linked+list.aspxhttp://www.techbaba.com/Login.aspx?pageurl=http://www.techbaba.com/q/3019-difference+arrays+linked+list.aspxhttp://www.techbaba.com/Login.aspx?pageurl=http://www.techbaba.com/q/3019-difference+arrays+linked+list.aspxhttp://www.techbaba.com/q/599-difference+yielding+sleeping.aspxhttp://www.techbaba.com/q/599-difference+yielding+sleeping.aspxhttp://www.techbaba.com/q/599-difference+yielding+sleeping.aspxhttp://www.techbaba.com/q/1602-difference+microsoft+net+framework+2+0+3+5.aspxhttp://www.techbaba.com/q/1602-difference+microsoft+net+framework+2+0+3+5.aspxhttp://www.techbaba.com/q/1602-difference+microsoft+net+framework+2+0+3+5.aspxhttp://www.techbaba.com/q/2473-leader+vs+manager+difference+management+leadership.aspxhttp://www.techbaba.com/q/2473-leader+vs+manager+difference+management+leadership.aspxhttp://www.techbaba.com/q/2473-leader+vs+manager+difference+management+leadership.aspxhttp://www.techbaba.com/q/2559-difference+is+as+keyword+c%23.aspxhttp://www.techbaba.com/q/2559-difference+is+as+keyword+c%23.aspxhttp://www.techbaba.com/q/2559-difference+is+as+keyword+c%23.aspxhttp://www.techbaba.com/q/3228-please+tell+whether+object+web+technologies+www+owgroups+com+kolkata+genuine+fraud.aspxhttp://www.techbaba.com/q/3228-please+tell+whether+object+web+technologies+www+owgroups+com+kolkata+genuine+fraud.aspxhttp://www.techbaba.com/q/3228-please+tell+whether+object+web+technologies+www+owgroups+com+kolkata+genuine+fraud.aspxhttp://www.techbaba.com/q/3228-please+tell+whether+object+web+technologies+www+owgroups+com+kolkata+genuine+fraud.aspxhttp://www.techbaba.com/q/4273-1+give+one+example+runtime+polymorphism+2+difference+compiletime+poly+runtime+poly.aspxhttp://www.techbaba.com/q/4273-1+give+one+example+runtime+polymorphism+2+difference+compiletime+poly+runtime+poly.aspxhttp://www.techbaba.com/q/4273-1+give+one+example+runtime+polymorphism+2+difference+compiletime+poly+runtime+poly.aspxhttp://www.techbaba.com/q/4273-1+give+one+example+runtime+polymorphism+2+difference+compiletime+poly+runtime+poly.aspxhttp://www.techbaba.com/q/4273-1+give+one+example+runtime+polymorphism+2+difference+compiletime+poly+runtime+poly.aspxhttp://www.techbaba.com/q/4273-1+give+one+example+runtime+polymorphism+2+difference+compiletime+poly+runtime+poly.aspxhttp://www.techbaba.com/q/4273-1+give+one+example+runtime+polymorphism+2+difference+compiletime+poly+runtime+poly.aspxhttp://www.techbaba.com/q/3228-please+tell+whether+object+web+technologies+www+owgroups+com+kolkata+genuine+fraud.aspxhttp://www.techbaba.com/q/3228-please+tell+whether+object+web+technologies+www+owgroups+com+kolkata+genuine+fraud.aspxhttp://www.techbaba.com/q/3228-please+tell+whether+object+web+technologies+www+owgroups+com+kolkata+genuine+fraud.aspxhttp://www.techbaba.com/q/2559-difference+is+as+keyword+c%23.aspxhttp://www.techbaba.com/q/2559-difference+is+as+keyword+c%23.aspxhttp://www.techbaba.com/q/2473-leader+vs+manager+difference+management+leadership.aspxhttp://www.techbaba.com/q/2473-leader+vs+manager+difference+management+leadership.aspxhttp://www.techbaba.com/q/1602-difference+microsoft+net+framework+2+0+3+5.aspxhttp://www.techbaba.com/q/1602-difference+microsoft+net+framework+2+0+3+5.aspxhttp://www.techbaba.com/q/599-difference+yielding+sleeping.aspxhttp://www.techbaba.com/q/599-difference+yielding+sleeping.aspxhttp://www.techbaba.com/Login.aspx?pageurl=http://www.techbaba.com/q/3019-difference+arrays+linked+list.aspxhttp://www.techbaba.com/Register.aspx?pageurl=http://www.techbaba.com/q/3019-difference+arrays+linked+list.aspx


15/15

Documents

Arrays Are Linear Data Structure