Representation of arrays, Data Structure & Algorithms

REPRESENTATION OF ARRAYS

This is not uncommon to determine a large number of programs which procedure the elements of an array in sequence. However, does it mean that the elements of an array are also stored in a particular sequence in memory. The answer based on the operating system under which the program is running. Though, the elements of an array are stored in particular sequence to the extent possible. If they are being stored in a particular sequence, then how are they sequenced. Is it that the elements are stored row wise or column wise? Again, it based on the operating system. The former is called as row major order & the later on is called column major order.

Posted Date: 4/4/2013 6:45:11 AM | Location : United States







Related Discussions:- Representation of arrays, Assignment Help, Ask Question on Representation of arrays, Get Answer, Expert's Help, Representation of arrays Discussions

Write discussion on Representation of arrays
Your posts are moderated
Related Questions
Illustrate the Back Face Detection Method A single polyhedron is a convex solid, which has no external angle between faces less  than 180° and there is a simple object space me

Encryption the plain-text using the round keys: 1. (Key schedule) Implement an algorithm that will take a 128 bit key and generate the round keys for the AES encryption/decryp

Question 1 Explain how the shuttle sort algorithm works by making use of the following list of integers:11, 4, 2, 8, 5, 33, 7, 3, 1, 6. Show all the steps. Question 2

Which data structure is required to change infix notation to postfix notation?    Stack function is used to change infix notation to postfix notatio n

merge sort process for an example array {38, 27, 43, 3, 9, 82, 10}. If we take a closer look at the diagram, we can see that the array is recursively divided in two halves till the

Explain the bubble sort algorithm. Answer This algorithm is used for sorting a list. It makes use of a temporary variable for swapping. It compares two numbers at an insta

A Sort which relatively passes by a list to exchange the first element with any element less than it and then repeats with a new first element is called as      Quick sort.

write a program that find,search&replace a text string

A linked list can be of the following types:-  Linear linked list or one way list Doubly linked list or two way list. Circular linked list Header linked list

P os t - o r d e r T r av er sal :  This can be done by both iteratively and recursively. The iterative solution would require a modification or alteration of the in-