adplus-dvertising
frame-decoration

Question

Consider an array A[20. 10], assume 4 words per memory cell and the base address of array A is 100. What is the address of A[11,5]? Assume row major storage.

a.

560

b.

565

c.

570

d.

575

Answer: (a).560

Engage with the Community - Add Your Comment

Confused About the Answer? Ask for Details Here.

Know the Explanation? Add it Here.

Q. Consider an array A[20. 10], assume 4 words per memory cell and the base address of array A is 100. What is the address of A[11,5]? Assume row major storage.

Similar Questions

Discover Related MCQs

Q. Convert the following infix expression into its equivalent post fix expression (A + B^D)/(E - F) + G

Q. Any decision tree that sorts n elements has height

Q. Match the following .
     List- I                                                    List - II
a. Bucket sort                                      i. O(n^3/gn)
b. Matrix chain multiplication           ii. O(n^3) 
c. Huffman codes                             iii. O(nlgn)
d. All pairs shortest paths               iv. O(n)

code:
a   b   c   d

Q. Suppose that we have numbers between 1 and 1000 in a binary search tree and we want to search for the number 365. Which of the following sequences could not be the sequence of nodes examined ?

Q. Converting a primitive type data into its corresponding wrapper class object instance is called

Q. Consider the following statements-

(a) Depth - first search is used to traverse a rooted tree. 
(b) Pre - order, Post-order and Inorder are used to list the vertices of an ordered rooted tree.
(c) Huffman's algorithm is used to find an optimal binary tree with given weights.
(d) Topological sorting provides a labelling such that the parents have larger labels than their children.

Which of the above statements are true ?

Q. The inorder and preorder Traversal of binary Tree are dbeafcg and abdecfg respectively.The post order traversal is ______________.

Q. Level order Traversal of a rooted Tree can be done by starting from root and performing

Q. The average case occurs in the Linear Search Algorithm when :

Q. To determine the efficiency of an algorithm the time factor is measured by

Q. Which of the following algorithms sort n integers, having the range 0 to (n^2 - 1), in ascending order in O(n) time ?

Q. Which of the following is asymptotically smaller?

Q. Code blocks allow many algorithms to be implemented with the following parameters:

Q. Consider f(N) = g(N) + h(N) 
Where function g is a measure of the cost of getting from the start node to the current node N and h is an estimate of additional cost of getting from the current node N to the goal node. Then f(N) = h(N) is used in which one of the following algorithms ? 

Q. The reverse polish notation equivalent to the infix expression
((A + B) * C+ D)/(E + F + G)

Q. Superficially the term "object-oriented", means that, we organize software as a

Q. The number of different spanning trees in complete graph, K4 and bipartite graph, K2,2 have ____ and ____ respectively.

Q. When a method in a subclass has the same name and type signatures as a method in the superclass, then the method in the subclass ______ the method in the superclass.

Q. Consider the following operations performed on a stack of size 5:
Push(a); Pop(); Push(b); Push(c); Pop(); Push(d); Pop(); Pop(); Push(e);
Which of the following statements is correct?

Q. Suppose you are given a binary tree with n nodes, such that each node has exactly either zero or two children. The maximum height of the tree will be