Register

MOCK TEST DATA STRUCTURE

1,229 views
2 2 votes

Consider a two-dimensional array with elements stored in the form of lower triangular matrix. The elements must be crossed to read A[4, 2] from the array A[–6, ..., + 8, –6,..., + 8] whose base address 1000 is ________. (Assume elements are stored in row major order)

1 Answer

3 3 votes

OR

If we take the size of each element as 1 bytes. 

Then its actually asking for the address of A[4][2] in the lower triangular matrix.

In Row Major Order, A[i][j] = Base + Size( (i - lower1) *NNS + (j-lower2) )     //NNS = Natural No.Sum.

So, A[4][2] = 1000 + 1 ( ( 4-(-6) )*NNS + (2-(-6) ) )

                  = 1000 + (1+2+3+4+5+6+7+8+9+10) + 8

                  = 1000 + 55 + 8

                  = 1063

Voting & Accepting an answer helps improve the community
← Previous · Self Doubt IMPNext → · Virtual GATE questio...
← Previous in category · doubtNext in category → · hashing
Position:
Show:

Related questions

10 10 votes
1 1 answer
587
587 views
GO Classes asked Jul 28
587 views
GO Classes DPP | GATE CS, DA | Data Structure | AVL Tree
Rebalance the following tree so that it becomes a valid AVL tree:What will be the root after rebalancing?$10$ $12$ $16$ $20$
7 7 votes
1 1 answer
410
410 views
GO Classes asked Jul 28
410 views
GO Classes DPP | GATE CS, DA | Data Structure | Collision-Free Hash Parameter
For the keys:$47, 61, 36, 52, 56, 33, 92$consider the hash function:$h(k) = ((10k + 4) \bmod c) \bmod 7$Find the smallest positive integer $c$ such that no collisions occ...
4 4 votes
1 1 answer
309
309 views
GO Classes asked Jul 28
309 views
GO Classes DPP | GATE CS, DA | Data Structure | Heap Insertion
Suppose vector $A$ is a min-heap:$A = [2, 4, 3, 6, 7, 3, 5, 8, 9]$After calling $\texttt{Push(1)}$, what is the final heap array?$[1, 2, 3, 6, 4, 3, 5, 8, 9, 7]$ $[1, 4, ...
10 10 votes
1 1 answer
364
364 views
GO Classes asked Jul 28
364 views
GO Classes DPP | GATE CS, DA | Data Structure | Binary Tree Traversals
A binary tree has:$1000$ nodes in the left subtree $100$ nodes in the right subtreeHow many nodes are processed before the root in preorder, inorder, and postorder traver...