Explain how two dimensional arrays are represented in memory, Data Structure & Algorithms

Assignment Help:

Explain how two dimensional arrays are represented in memory.

Representation of two-dimensional arrays in memory:-

Let grades be a 2-D array as grades [3][4]. The array will be shown in memory by a block of 3*4=12 sequential memory locations. It can be keep in two ways: - row major wise or column major wise. The first set of four array elements is located in memory, followed by the second set of four array elements, and so on.

 


Related Discussions:- Explain how two dimensional arrays are represented in memory

Declaring a two dimensional array, Declaring a two dimensional array   A...

Declaring a two dimensional array   A two dimensional array is declared same to the way we declare a one-dimensional array except that we state the number of elements in both di

Algorithm to add element in the end of circular linked list, Q. Write down ...

Q. Write down an algorithm to add an element in the end of the circular linked list.        A n s . Algo rithm to Add the Element at the End of Circular Linked Lists

Java code and algorythem, Suppose that you want to develop a program that a...

Suppose that you want to develop a program that accepts a postfix expression and asks values for variables in the expression. Then you need to calculate the answer for the expressi

Explain Hashing, What do you mean by hashing? Hashing gives the direct ...

What do you mean by hashing? Hashing gives the direct access of record from the file no matter where the record is in the file. This is possible with the help of a hashing func

Mapping constain, one to many one to one many to many many to one

one to many one to one many to many many to one

Multilist file organisation, what is multilist length file organisation? ex...

what is multilist length file organisation? explain with an example

Tree, tree is graph or not

tree is graph or not

Numerical - algorithm, Q. What is the smallest value of n such that an algo...

Q. What is the smallest value of n such that an algorithm whose running time is 100n2 runs faster than an algorithm whose running time is 2n on the same machine.    A n

Conversion of forest into tree, Conversion of Forest into Tree A binary...

Conversion of Forest into Tree A binary tree may be used to show an entire forest, since the next pointer in the root of a tree can be used to point to the next tree of the for

Implement an open hash table, In a chained hash table, each table entry is ...

In a chained hash table, each table entry is a pointer to a collection of elements. It can be any collection that supports insert, remove, and find, but is commonly a linked list.

Write Your Message!

Captcha
Free Assignment Quote

Assured A++ Grade

Get guaranteed satisfaction & time on delivery in every assignment order you paid with us! We ensure premium quality solution document along with free turntin report!

All rights reserved! Copyrights ©2019-2020 ExpertsMind IT Educational Pvt Ltd