Skip to content

CSE2135 - Data Structure

Arrays, Records, and Pointers

Term 161

  • Q2(b) [5]: Consider the linear arrays \(X(-10:10)\), \(Y(1935:1985)\), \(Z(35)\).
  • Find the number of elements in each array.
  • Suppose Base (Y) = 400 and \(w=4\) words per memory cell for Y. Find the address of Y[1942], Y[1977] and Y[1988].
  • Q2(c) [6]: Define Sparse matrix. Write down the Matrix Multiplication algorithm.

Term 171

  • Q3(d) [1+3]: Define static, semistatic and dynamic variable.

Term 201

  • Q1(b) [4]: Suppose DATA is an array of numerical values in memory. Write down the algorithm and the flow chart to find the location LOC and the value MAX of the largest element in DATA.
  • Q2(d) [1+1]: Define linear array. Which operations are normally performed on any linear structure?

Term 211

  • Q1(b) [3]: Write an algorithm/pseudocode to delete a given element k from an array A of n elements? Assume that the element k is always present in A.