Annotated Bibliography

700 Words2 Pages

Contents Page 1....................................Cover Page Page 2.....................................Bibliography Page 3......................................1.1 and 1.2 Page 4......................................1.4 Page 5……………………………..1.5 Page 6.........................................2.1 Page 7………………………………2.2 Page 8.......................................2.3 Page 9...........................................Bibliography and References Question 1 1.1) A constant is a value that is fixed and may not change throughout the whole program. The value may not change and also may not change in a very long time. The rules that variable have definitely applies to constants as well, except that a constant has a value that is fixed and will …show more content…

Other data structures can be implemented like different types of data structures like graphs, queues and trees. (Kakria, 2017) It brings variables together that are of the same type and groups them together for the purpose of efficient coding. Data may be stored in the elements of an array. It can also be manipulated as the same way as normal variables. It has the ability to store many items at the same time. Random accessing of elements is allowed, so any element of an array can be accessed randomly using indexes. It stores the data in linear form. (Sheeba, 2016) The memory arrangements are efficient. 1D arrays are faster. It is much cheaper. It happens to be a standard array and the array size is fixed. The memory that is allocated to an array can not be reduced or increase. The elements of a 1D array are kept in successive memory locations. A one dimensional array is a standard array. An advantage is also that you may loop through it, read them, sort them and also set the variables. (James, 2017) In terms of receiving parameters, it may be received inside a pointer, unsized array or sized array. (Henry,

Open Document