Suprize Test - 6.10.2022

Time complexity depends on

• The machine we are executing on

• Time required by each machine

• Machine language instruction set

• All the above

Abstract data types means

• Separation of physical representation of data from its logical level

• Collection of data

• A logical picture of data type of various data elements and just specification of operations

• Just specification of operations

In practice -----is used to define tight upper bound on growth of function f(n).

• Big O

• Big Omega

• Big theta

• Big alpha

Which of the following is not example of divide & conquer strategy?

• Dijkstra's algorithm

• Merge Sort

• Quick sort

• Binary Search

Consider the following code & obtain the time complexity While(n >0) n=n/2;

• O (n)

• O (log n)

• O (n^2)

• O (n log(n))

A matrix P[15][10] is stored with each element requiring 8 bytes of storage. If the base address

at P[0][0] is 1400, determine the address at P[10][7] when the matrix is stored in Row Major Wise.

• 2254

• 2256

• 2200

• 2250

If two matrices A[m*n] & B[n*p] are multiplied then complexity of multiplication will be:

• O (m*n*p)

• O(m^2 n^2 p^2 )

• O(m^2 * P^2)

• O( m+1 n+1 p+1)

What is the maximun number of dimensions an array in C may have?

• Two

• Eight

• Twenty

• Theoratically no limit. The only practical limits are memory size and compilers

  5

Time complexity of linear search is:

• O(n)

• O(1)

• O(log n)

• O(n^2)

Given an array [1…6,1…8] of integers. Calculate address element T[5,7] using column major

technique, where Base Address=300.

• 340

• 342

• 256

• 300