Define when we should use plain list
Define when we should use plain list.
Expert
Plain List:
Stores all items sequentially, therefore random lookup is very fast (which I can instantly say "I wish for the 657415671567th element, and go straight to this, since we know its memory address will be specifically 657415671567 superior than the first item). It has little or no memory overhead within storage. Although, it has no way of automatically resized - you have to create a newest array, copy across all the values, and after that delete the old one. Plain lists are helpful while you require to lookup data from anywhere within the list, and you identify that your list will not be longer than an exact size.
Describe the term two-dimensional array by using example?
Define cohension and coupling?
Define the fastest sorting method to use?
Explain how the Doubly Linked List associated with the Circular Linked List?
Describe in brief the word Quick Sort?
Write down the various types of algorithms?
Explain binary tree?
What is meant by the double linked list?
Define testing?
Describes the uses of Tree Database?
18,76,764
1954242 Asked
3,689
Active Tutors
1418832
Questions Answered
Start Excelling in your courses, Ask an Expert and get answers for your homework and assignments!!