DS week2

If elements of the data structure form a sequence of the list then it is called as _________.

• Linear data structure

• Primitive data structure

• Non-primitive data structure

• None of these

Which is non-primitive data type from these?

• Integer

• Character

• Double

• Array

The Term Data structure refers to _______ and interrelationships between them.

• Programming Language Statement

• 
  Coding standards

• Organization of data element

• None of these

void f(){

int a = 0, b =0;

for( i = 1; i<n; i++)

a += i;

for(i = 1; i<m; i++)

b += i;

}

The time complexity of the above code is:

• O(n)

• O(m)

• O(m + n)

• O(n * m)

void f(){

int a[n][n],sum = 0

for(i = 0; i<n; i++)

for(j =0; j<n; j++)

sum += a[i][j];

print(sum);

}

The time complexity of above program is:

• O(n)

• O(n log n)

• O(n^2)

• O(n^3)

What is the length of an array when its first index is denoted by i and last index is denoted by j?

• i + j

• j - i - 1

• j - i

• j - i + 1

If the integer data type requires 2 bytes, then what will be the size of following declared array:

int a[2][3];

• 24 bytes

• 12 bytes

• 6 bytes

• 10 bytes

Which of the following code is implemented for inserting an element into array?

• for(i=pos; i<n; i++)

  {

  a[i+1] = a[i];

  }

  n++;

• for(i=n-1; i>pos; i--)

  {

  a[i+1] = a[i];

  }

  n++;

• for(i=n-1; i>pos; i--)

  {

  a[i] = a[i+1];

  }

  n++;

• for(i=pos; i<n; i++)

  {

  a[i] = a[i+1];

  }

  n++;

for(i=0; i<n; i++){

for(j=i+1; j<n; j++){

if(a[i] == a[j]){

pos=j;

for(----------){

--------------;

}

n--;

} } }

• k=pos; k<n; k++

  a[i+1] = a[i]

• k=n-1; k>pos; k--

  a[i] = a[i+1]

• k=n-1; k>pos; k--

  a[i+1] = a[i]

• k=pos; k<n; k++

  a[i] = a[i+1]

What is the worst case for linear search?

• O(n logn)

• O(logn)

• O(n)

• O(1)