2-D Array Element Address Calculation – Computer Sir Ki Class

Login


Lost your password?

Don't have an account ?
Register (It's FREE) ×
  

Login
[lwa]



Exam Questions-CBSE12A-2018-03C #CPP#5281    siteicon   siteicon  

Problem Statement - 2-D Array Element Address Calculation

Let us assume Data[20][15] is a two dimensional array, which is stored in the memory along the row with each of its element occupying 2 bytes, find the address of the element Data[10][5], if the element Data[15][10] is stored at the memory location 15000.

Solution

TC++ #5281

LOC(Data[10][5]) = LOC(Data[15][10])+2(15*(10-15)+(5-10))
= 15000 + 2((-75) + (-5))
= 15000 + 2(-80)
= 15000 – 160
= 14840

Notes

Since it is a row major implementation we can use the following formula-

LOC(Data[I][J]) = Base(Data)+W*(NC*(I-LBR)+(J-LBC))

Where
LOC(Data[I][J]) = Location element we need to compute
Base(Data)          = Reference Location from which we need to find the address
W                          = Width of each element
NC                        = Number of columns in the array
I                            = Row number of Location element to be found
J                            = Column number of Location element to be found
LBR                      = Lower Bound of Row of Base address
LBC                     =  Lower Bound of Columns of Base address

 


Share

CSKC| Created: 5-Dec-2018 | Updated: 10-Oct-2019|CBSE12A-2018






×
Introductory Sessions Beginning to Program Tokens Keyword and Identifiers Data Types Variables and Constants Operators Simple User Input Building Expressions and Formulas Simple Real World Problems Simple If and If Else Multiple-Nested-Ladder of If Else Switch case selection Simple Loops Tricks in Loops - break continue scope Loop Applications - Handling numerals Series printing loops Nested Loops Pattern printing loops Number Varieties and Crunches String Handling (Null Terminated) Strings - string class type Functions (Built-in) Functions - user defined Functions Reference Passing/Returning Arrays Concepts and 1-D Arrays Array Data Management Two dimensional arrays and Matrices Structures Basics Structures passing/returning 2D Array Memory Addressing Display Using IO Manipulation Display Using C Formatting Tricks User Defined Data Types Enumerated Types Preprocessor Directives And Macros Exception Handling Programming Paradigms and OOPs Advantages Abstraction and Encapsulation Polymorphism Inheritance Function Overloading Concepts Function Overloading Varieties Function Overloading Special Cases Defining Classes Creating and Using Class Objects Class Members Accessibility Class Function Types Inline Functions Constant Functions Nesting of Functions Class Members Scope Resolution Static Members in a Class Array of Objects Constructor Concepts Default Constructor Parameterized Constructor Copy Constructor Constructor Overloading Destructors Inheritance Fundamentals Public Derivations Private and Protected Derivations Multiple Inheritance Mult-Level Inheritance Class Nesting Data File Concepts Handling Text Files Handling Binary Files Pointer Concepts Pointer and Arrays Pointers and Functions Object Pointers This Pointer Linked Lists Stacks Queues


Back