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

#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

In-order traversal, Write steps for algorithm for In-order Traversal Th...

Write steps for algorithm for In-order Traversal This process when implemented iteratively also needs a stack and a Boolean to prevent the execution from traversing any portion

Create a function to show data structure, Given a number that is represente...

Given a number that is represented in your data structure, you will need a function that prints it out in base 215 in such a way that its contents can be checked for correctness. Y

Stack, Explain the array and linked list implementation of stack

Explain the array and linked list implementation of stack

Algorithm, what algorithms can i use for the above title in my project desi...

what algorithms can i use for the above title in my project desing and implmentation of road transport booking system

Define threaded binary tree, Threaded Binary Tree:- By changing the NUL...

Threaded Binary Tree:- By changing the NULL lines in a binary tree to special links known as threads, it is possible to perform traversal, insertion and deletion without using

Arithmetic expression, How to convert infix postfix and prefix??

How to convert infix postfix and prefix??

#input restricted DEQUE, #why all the 4 operations i.e. insertion n del...

#why all the 4 operations i.e. insertion n deletion from rear end and front end is valid in input restricted DEQUE

Data mining assignment, The assignment aims at consolidating your knowledge...

The assignment aims at consolidating your knowledge on data mining techniques and developing practical skills through solving a problem of transcription factor binding sites recogn

Calculation of storage complexity, Since memory is becoming more & cheaper,...

Since memory is becoming more & cheaper, the prominence of runtime complexity is enhancing. However, it is very much significant to analyses the amount of memory utilized by a prog

Write Your Message!

Name

Email id

Message

Verfication Code

User Account

All Pages