Q1. Deduce an expression to determine the memory address of any general element in n-dimensional array in which the address of first element is α. Suppose that each and every elements are stored in the column major order. When the length of all the words is w then how would this expression alter?

Q2. The Ackerman function is defined as shown below:

A(m, n) = n + 1 if m = 0
A(m, n) = A(m-1, 1) if m ≠ 0 and n =0
A(m, n) = A(m-1, A(m,n-1)) if m ≠ 0 and n ≠ 0

prepare down the recursive function for A(m ,n). Can we find out manually that how many times this function is called for the A(3, 5)?

Q3. Apply the Dijkshtra’s algorithm to determine the shortest path between s and t in the given graph.