Arrays are simple, however reliable to employ in more condition than you can count. Arrays are utilized in those problems while the number of items to be solved out is fixed. They are uncomplicated to traverse, search & sort. It is extremely simple to manipulate an array instead of other subsequent data structures. Arrays are utilized in that condition in which the size of array can be established beforehand. Also, they are utilized in condition where insertions & deletions are minimal or not present. Insertion & deletion operations will lead to wastage of memory or will enhance the time complexity of the program because of the reshuffling of elements.

Posted Date: 4/4/2013 6:48:52 AM | Location : United States

Ask an Expert

Related Discussions:- Applications, Assignment Help, Ask Question on Applications, Get Answer, Expert's Help, Applications Discussions

Write discussion on Applications
Your posts are moderated

Write your message here..

Related Questions

#title.structured programming, what do you understand by structured program... what do you understand by structured programming?explain with eg. top down and bottem up programming technique

Chaining Method as Method of Collision Resolution , Q. The given values are... Q. The given values are to be stored in a hash table 25, 42, 96, 101, 102, 162, 197 Explain how the values are hashed by using division technique of hashing with a table

Representation of data structure in memory, Representation of data structur... Representation of data structure in memory is known as: Abstract data type

Complexity of an algorithm, An algorithm is a sequence of steps to solve a ... An algorithm is a sequence of steps to solve a problem; there may be more than one algorithm to solve a problem. The choice of a particular algorithm depends upon following cons

Acyclic graph, Tree is a widely used data structure employed for representi... Tree is a widely used data structure employed for representing several problems. We studied tree like a special case of acyclic graph. Though, rooted trees are most prominent of al

Applications of shortest path algorithms, The minimum cost spanning tree ha... The minimum cost spanning tree has broad applications in distinct fields. It represents several complicated real world problems such as: 1. Minimum distance for travelling all o

Abstract data types, Abstract Data Types :- A useful tool for specifying th... Abstract Data Types :- A useful tool for specifying the logical properties of a data type is the abstract data type or ADT. The term "abstract data type" refers to the basic mathem

Determine yiq colour model, Determine YIQ Colour Model Whereas an RGB m... Determine YIQ Colour Model Whereas an RGB monitor requires separate signals for the red, green, and blue components of an image, a television monitor uses a single composite si

Sorting algorithm, Sorting Algorithm A sorting algorithm is an algorit... Sorting Algorithm A sorting algorithm is an algorithm which puts elements of a list in a certain order. The most-used orders are numerical order and lexicographical order. Eff

Define dynamic programming, Define Dynamic Programming  Dynamic  progra... Define Dynamic Programming  Dynamic  programming  is  a  method  for  solving  problems  with  overlapping  problems.  Typically, these sub problems arise from a recurrence rel