Now you have selected the data structure. Suppose a programmer has inserted some data and wants to insert more data. This data will be inserted in the beginning of the existing data, or in the middle or in the end of the data. Let’s talk about the arrays and suppose you have an array of size hundred. Data may be lying in the first fifty locations of this array. Now you have to insert data in the start of this array. What will you do? You have to move the existing data (fifty locations) to the right so that we get space to insert new data. Other way round, there is no space in the start. Suppose you have to insert the data at 25^th location. For this purpose, it is better to move the data from 26^th to 50^th locations; otherwise we will not have space to insert this new data at 25^th location. Now we have to see whether the data can be deleted or not. Suppose you are asked to delete the data at 27^th position. How can we do that? What will we do with the space created at 27^th position? Thirdly, is all the data processed in some well-defined order or random access allowed? Again take the example of arrays. We can get the data from 0^th position and traverse the array till its 50^th position. Suppose we want to get the data, at first from 50^th location and then from 13^th. It means that there is no order or sequence. We want to access the data randomly. Random access means that we can’t say what will be the next position to get the data or insert the data.
	BACK	HOME	NEXT